Towards a Hypergraph version of the Pósa–Seymour Conjecture
Towards a Hypergraph version of the Pósa–Seymour Conjecture
One of the first results in graph theory was Dirac's theorem which claims that if the minimum degree in a graph is at least half of the number of vertices, then it contains a Hamiltonian cycle. This result has inspired countless other problems and results all stating that in dense …