Spanning trees in dense directed graphs
Authors:
- Amarja KathapurkarAKAmarja Kathapurkar
- Richard MontgomeryRMRichard Montgomery
- 16 May 2022
- journal article
- research article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 156, 223-249
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Horizon 2020
- H2020 European Research Council (947978)
- Leverhulme Trust (PLP-2020-183)
- European Research Council
This publication has 11 references indexed in Scilit:
- Spanning trees in random graphsAdvances in Mathematics, 2019
- Spanning Trees of Dense Directed GraphsElectronic Notes in Theoretical Computer Science, 2019
- Semi-Degree Threshold for Anti-Directed Hamiltonian CyclesThe Electronic Journal of Combinatorics, 2015
- Arbitrary Orientations of Hamilton Cycles in DigraphsSIAM Journal on Discrete Mathematics, 2015
- The minimum degree threshold for perfect graph packingsCombinatorica, 2009
- Proof of the bandwidth conjecture of Bollobás and KomlósMathematische Annalen, 2008
- An approximate Dirac-type theorem for k-uniform hypergraphsCombinatorica, 2008
- Spanning Trees in Dense GraphsCombinatorics, Probability and Computing, 2001
- Proof of the Seymour conjecture for large graphsAnnals of Combinatorics, 1998
- Proof of a Packing Conjecture of BollobásCombinatorics, Probability and Computing, 1995