Counting oriented trees in digraphs with large minimum semidegree

DOI10.1016/J.JCTB.2024.05.004MaRDI QIDQ6564611zbMATH OpenFDO

Authors Felix Joos, Jonathan Schrodt

Publication date 1 July 2024

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

Full work available at URL https://doi.org/10.1016/J.JCTB.2024.05.004

zbMATH Keywords

countingdigraphsspanning trees

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30)

Recommendations

• Spanning trees in dense directed graphs
• Spanning trees of dense directed graphs
• Subtrees of bipartite digraphs---the minimum degree condition
• Antidirected subgraphs of oriented graphs

Cites work

• Compatible Hamilton cycles in Dirac graphs
• Counting Hamilton cycles in Dirac hypergraphs
• Entropy bounds for perfect matchings and Hamiltonian cycles
• Fractional cycle decompositions in hypergraphs
• Hamiltonian cycles in Dirac graphs
• Optimal packings of bounded degree trees
• Proof of a Packing Conjecture of Bollobás
• Robust Hamiltonicity of Dirac graphs
• Spanning trees in dense directed graphs
• Spanning trees in dense graphs
• Weighted sums of certain dependent random variables

Cited in

(2)

• Spanning trees of dense directed graphs
• Randomly perturbed digraphs also have bounded-degree spanning trees

This page was built for publication: Counting oriented trees in digraphs with large minimum semidegree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564611)