Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Antidirected trees in dense digraphs (2404.10750v3)

Published 16 Apr 2024 in math.CO

Abstract: We show that if $D$ is an $n$-vertex digraph with more than $(k-1)n$ arcs that does not contain any of three forbidden digraphs, then $D$ contains every antidirected tree on $k$ arcs. The forbidden digraphs are those orientations of $K_{2, \lceil k/12\rceil}$ where each of the vertices in the class of size two has either out-degree $0$ or in-degree $0$. This proves a conjecture of Addario-Berry et al. for a broad class of digraphs, and generalises a result for $K_{2, \lfloor k/12\rfloor}$-free graphs by Balasubramanian and Dobson. We also show that every digraph $D$ on $n$ vertices with more than $(k-1)n$ arcs contains every antidirected $k$-arc caterpillar, thus solving the above conjecture for caterpillars. This generalises a result of Perles.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (14)
  1. Oriented trees in digraphs. Discrete Math., 313(8):967–974, 2013.
  2. S. Balasubramanian and E. Dobson. Constructing trees in graphs with no K2,ssubscript𝐾2𝑠K_{2,s}italic_K start_POSTSUBSCRIPT 2 , italic_s end_POSTSUBSCRIPT. J. Graph Theory, 56(4):301–310, 2007.
  3. On the Erdős-Sós conjecture for trees with bounded degree. Combin. Probab. Comput., 30(5):741–761, 2021.
  4. S. A. Burr. Subtrees of directed graphs and hypergraphs. In Proceedings of the Eleventh South- eastern Conference on Combinatorics, Graph Theory and Combinatorics (Florida Atlantic Univ., Boca Raton, Fla., volume I,28, pages 227–239, 1980.
  5. Long antipaths and anticycles in oriented graphs. arXiv preprint arXiv:2401.05205, 2024.
  6. P. Erdős. Extremal problems in graph theory. Theory of graphs and its applications, Proc. Sympos. Smolenice, pages 29–36, 1964.
  7. R. L. Graham. On subtrees of directed graphs with no path of length exceeding one. Canad. Math. Bull., 13(3):329–332, 1970.
  8. G. Kalai. Micha Perles’ Geometric Proof of the Erdős–Sós Conjecture for Caterpillars. https://gilkalai.wordpress.com/2017/08/29/micha-perles-geometric-proof-of-the-erdos-sos-conjecture-for-caterpillars/, 2017. Accessed: March 2024.
  9. T. Klimošová and M. Stein. Antipaths in oriented graphs. Discrete Math., 346(9):113515, 2023.
  10. W. Moser and J. Pach. Recent developments in combinatorial geometry. New Trends in Discrete and Computational Geometry, pages 281–302, 1993.
  11. V. Rozhoň. A local approach to the Erdős–Sós conjecture. SIAM J. Discrete Math., 33(2):643–664, 2019.
  12. M. Stein. Tree containment and degree conditions, in A. Raigoroskii and M. Rassias, editors. Discrete Math. Appl., pages 459–486, 2021.
  13. M. Stein. Oriented trees and paths in digraphs. In F. Fischer and R. Johnson, editors, Surveys in Combinatorics 2024, London Mathematical Society Lecture Note Series. Cambridge University Press, 2024.
  14. M. Stein and C. Zárate-Guerén. Antidirected subgraphs of oriented graphs. Combin. Probab. Comput., pages 1–21, 2024.
Citations (1)

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com