Metraipolis › archive › dc_fc608a72ffe7

Note on near-spanning balanced antidirected trees missing from regular tournaments — arXiv:2610.02390

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.02390
License (as archived)
CC0-1.0
Archived
2026-10-06T08:24:35.716Z
SHA-256 of the archived text
6a34bdd6f2f6ad1607b46de25ddcf3e10c3e9be9d1eafcea83a5296bb296e03f
Stable URL of this page
https://metraipolis.com/documento/dc_fc608a72ffe7

How to cite

Note on near-spanning balanced antidirected trees missing from regular tournaments — arXiv:2610.02390 — arXiv (en), https://arxiv.org/abs/2610.02390 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fc608a72ffe7 (Metraipolis archive dc_fc608a72ffe7, sha256 6a34bdd6f2f6ad1607b46de25ddcf3e10c3e9be9d1eafcea83a5296bb296e03f)
BibTeX
@misc{dcfc608a72ffe7,
  title = {Note on near-spanning balanced antidirected trees missing from regular tournaments — arXiv:2610.02390},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.02390},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fc608a72ffe7; sha256 6a34bdd6f2f6ad1607b46de25ddcf3e10c3e9be9d1eafcea83a5296bb296e03f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.02390. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We construct near-spanning balanced antidirected trees that fail to embed in highly symmetric tournaments despite the conjectured semidegree condition being satisfied. More precisely, for every sufficiently large odd integer $n$, we exhibit a regular vertex-transitive tournament on $n$ vertices and a balanced antidirected caterpillar on $n-1$ vertices with maximum degree at most $(1+o(1))n/\log_2 n$ that is not contained in the tournament. The host satisfies the strict $k/2$ threshold in both the semidegree and pseudo-semidegree settings, where $k$ is the number of arcs of the target tree. Consequently, this gives counterexamples to the uniform sublinear-degree interpretations of Conjectures~6.8 and~7.6 in Stein's survey (2024). The order $n-1$ of the target is best possible under the strict semidegree hypothesis. We also give a six-vertex balanced antidirected double-star missing from the seven-vertex Paley tournament, and show that seven is the smallest host order for a pseudo-semidegree counterexample with this fixed double-star.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-05 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2610.02390 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T08:18:48.281Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).