Hypergraphs, quasi-randomness, and conditions for regularity
Journal of Combinatorial Theory Series A
Regularity lemma for k-uniform hypergraphs
Random Structures & Algorithms
A Dirac-Type Theorem for 3-Uniform Hypergraphs
Combinatorics, Probability and Computing
Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
Journal of Combinatorial Theory Series B
Regular Partitions of Hypergraphs: Regularity Lemmas
Combinatorics, Probability and Computing
Regular Partitions of Hypergraphs: Counting Lemmas
Combinatorics, Probability and Computing
Hamiltonian chains in hypergraphs
Journal of Graph Theory
Dirac-type results for loose Hamilton cycles in uniform hypergraphs
Journal of Combinatorial Theory Series B
Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
European Journal of Combinatorics
On extremal hypergraphs for Hamiltonian cycles
European Journal of Combinatorics
Packing tight Hamilton cycles in 3-uniform hypergraphs
Random Structures & Algorithms
Packing hamilton cycles in random and pseudo-random hypergraphs
Random Structures & Algorithms
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs
Journal of Combinatorial Theory Series B
| Hi-index | 0.00 |
We say that a k-uniform hypergraph C is an @?-cycle if there exists a cyclic ordering of the vertices of C such that every edge of C consists of k consecutive vertices and such that every pair of consecutive edges (in the natural ordering of the edges) intersects in precisely @? vertices. We prove that if 1=