Publisher
Springer International Publishing
Reference126 articles.
1. L. Addario-Berry, F. Havet, C. Linhares Sales, B. Reed, S. Thomassé, Oriented trees in digraphs. Discrete Math. 313, 967–974 (2013)
2. M. Ajtai, J. Komlós, E. Szemerédi, The longest path in a random graph. Combinatorica 1(1), 1–12 (1981)
3. M. Ajtai, J. Komlós, E. Szemerédi, On a conjecture of Loebl, in Graph Theory, Combinatorics, and Algorithms, Vol. 1, 2 (Kalamazoo, MI, 1992) (Wiley, New York, 1995), pp. 1135–1146
4. P. Allen, J. Böttcher, O. Cooley, R. Mycroft, Tight cycles and regular slices in dense hypergraphs. J. Combin. Theory Ser. A 149, 30–100 (2017)
5. N. Alon, M. Krivelevich, B. Sudakov, Embedding nearly-spanning bounded degree trees. Combinatorica 27(6), 629–644 (2007)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Oriented Trees and Paths in Digraphs;Surveys in Combinatorics 2024;2024-06-13
2. Graphs of minimum degree at least ⌊d/2⌋ and large enough maximum degree embed every tree with d vertices;Procedia Computer Science;2023
3. Semidegree, edge density and antidirected subgraphs;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023
4. Beyond the Erdős–Sós conjecture;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023