@InProceedings{dippel_et_al:LIPIcs.STACS.2024.28,
  author =	{Dippel, Jack and Vetta, Adrian},
  title =	{{One n Remains to Settle the Tree Conjecture}},
  booktitle =	{41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
  pages =	{28:1--28:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-311-9},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{289},
  editor =	{Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.28},
  URN =		{urn:nbn:de:0030-drops-197388},
  doi =		{10.4230/LIPIcs.STACS.2024.28},
  annote =	{Keywords: Algorithmic Game Theory, Network Creation Games, Tree Conjecture}
}