Recent advances on Dirac-type problems for hypergraphs
Author:
- 13 April 2016
- book chapter
- Published by Springer Nature
- p. 145-165
Abstract
No abstract availableKeywords
All Related Versions
This publication has 65 references indexed in Scilit:
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs IIJournal of Combinatorial Theory, Series A, 2013
- The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegreeEuropean Journal of Combinatorics, 2013
- A survey on Hamilton cycles in directed graphsEuropean Journal of Combinatorics, 2012
- The Size of a Hypergraph and its Matching NumberCombinatorics, Probability and Computing, 2012
- Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphsAdvances in Mathematics, 2011
- Perfect matchings in large uniform hypergraphs with large minimum collective degreeJournal of Combinatorial Theory, Series A, 2009
- Proof of the Alon–Yuster conjectureDiscrete Mathematics, 2001
- Blow-up LemmaCombinatorica, 1997
- Near Perfect Coverings in Graphs and HypergraphsEuropean Journal of Combinatorics, 1985
- The Factorization of Linear GraphsJournal of the London Mathematical Society, 1947