Packing, counting and covering Hamilton cycles in random directed graphs
- 8 May 2017
- journal article
- research article
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 220 (1) , 57-87
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Counting and packing Hamilton cycles in dense graphs and oriented graphsJournal of Combinatorial Theory, Series B, 2017
- Proof of the 1-factorization and Hamilton Decomposition ConjecturesMemoirs of the American Mathematical Society, 2016
- On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random GraphsSIAM Journal on Discrete Mathematics, 2011
- Hamiltonian cycles in Dirac graphsCombinatorica, 2009
- The Probabilistic Method2008
- Hamiltonian Cycles in Regular TournamentsCombinatorics, Probability and Computing, 2007
- The Evolution of Random GraphsTransactions of the American Mathematical Society, 1984
- The solution of van der Waerden's problem for permanentsAdvances in Mathematics, 1981
- Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrixMathematical Notes, 1981
- Some Theorems on Abstract GraphsProceedings of the London Mathematical Society, 1952