Recent advances on Dirac-type problems for hypergraphs
Author:
Preprint
Abstract
A fundamental question in graph theory is to establish conditions that ensure a graph contains certain spanning subgraphs. Two well-known examples are Tutte's theorem on perfect matchings and Dirac's theorem on Hamilton cycles. Generalizations of Dirac's theorem, and related matching and packing problems for hypergraphs, have received much attention in recent years. New tools such as the absorbing method and regularity method have helped produce many new results, and yet some fundamental problems in the area remain unsolved. We survey recent developments on Dirac-type problems along with the methods involved, and highlight some open problems.Keywords
All Related Versions
This publication has 55 references indexed in Scilit:
- $F$ F -Factors in Hypergraphs Via AbsorptionGraphs and Combinatorics, 2014
- Recent Advances on the Hamiltonian Problem: Survey IIIGraphs and Combinatorics, 2013
- A hypergraph blow‐up lemmaRandom Structures & Algorithms, 2011
- Dirac-Type Questions For Hypergraphs — A Survey (Or More Problems For Endre To Solve)2010
- Perfect Matchings and K 4 3 -Tilings in Hypergraphs of Large CodegreeGraphs and Combinatorics, 2008
- Matchings in hypergraphs of large minimum degreeJournal of Graph Theory, 2005
- Advances on the Hamiltonian Problem - A SurveyGraphs and Combinatorics, 2003
- Blow-up LemmaCombinatorica, 1997
- H-Factors in Dense GraphsJournal of Combinatorial Theory, Series B, 1996
- On maximal paths and circuits of graphsActa Mathematica Hungarica, 1959