Spanning trees in dense directed graphs

DOI10.1016/j.jctb.2022.04.007zbMath1490.05031arXiv2102.03144OpenAlexW3128907751MaRDI QIDQ2673485

Yanyan Li

Publication date: 10 June 2022

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.03144

zbMATH Keywords

directed graphsextremal graph theorytree embedding

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semi-degree threshold for anti-directed Hamiltonian cycles
• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• Proof of the bandwidth conjecture of Bollobás and Komlós
• Proof of the Seymour conjecture for large graphs
• Spanning trees of dense directed graphs
• The minimum degree threshold for perfect graph packings
• Embedding rainbow trees with applications to graph labelling and decomposition
• Spanning trees in random graphs
• Spanning Trees in Dense Graphs
• Arbitrary Orientations of Hamilton Cycles in Digraphs
• Embedding large subgraphs into dense graphs
• Proof of a Packing Conjecture of Bollobás
• Large-scale structures in random graphs

This page was built for publication: Spanning trees in dense directed graphs