Counting oriented trees in digraphs with large minimum semidegree
Authors:
- Felix JoosFJFelix Joos
- Jonathan SchrodtJSJonathan Schrodt
Open Access
- 29 May 2024
- journal article
- research article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 168, 236-270
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Deutsche Forschungsgemeinschaft (428212407)
This publication has 11 references indexed in Scilit:
- Spanning trees in dense directed graphsJournal of Combinatorial Theory, Series B, 2022
- Fractional cycle decompositions in hypergraphsRandom Structures & Algorithms, 2021
- Counting Hamilton cycles in Dirac hypergraphsCombinatorics, Probability and Computing, 2020
- Compatible Hamilton cycles in Dirac graphsCombinatorica, 2016
- Robust Hamiltonicity of Dirac graphsTransactions of the American Mathematical Society, 2014
- Entropy bounds for perfect matchings and Hamiltonian cyclesCombinatorica, 2009
- Hamiltonian cycles in Dirac graphsCombinatorica, 2009
- Spanning Trees in Dense GraphsCombinatorics, Probability and Computing, 2001
- Proof of a Packing Conjecture of BollobásCombinatorics, Probability and Computing, 1995
- Weighted sums of certain dependent random variablesTohoku Mathematical Journal, 1967