Resilience for tight Hamiltonicity

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Tight cycles and regular slices in dense hypergraphs
Loose Hamilton cycles in random uniform hypergraphs
Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
Limit distribution for the existence of Hamiltonian cycles in a random graph
Hamiltonian circuits in random graphs
Dirac-type theorems in random hypergraphs
A Dirac-type theorem for Berge cycles in random hypergraphs
Co-degrees resilience for perfect matchings in random hypergraphs
Hamiltonicity in random graphs is born resilient
A relative Szemerédi theorem
Hypergraph regularity and the multidimensional Szemerédi theorem
On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three
Dirac's theorem for random graphs
A Dirac-Type Theorem for 3-Uniform Hypergraphs
Local resilience of graphs
Hamilton cycles in graphs and hypergraphs: an extremal perspective
Regularity Lemma for k-uniform hypergraphs
Tight Hamilton cycles in random uniform hypergraphs
Finding tight Hamilton cycles in random hypergraphs faster
Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs
Resilience of perfect matchings and Hamiltonicity in random graph processes
Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
Tight Hamilton cycles in random hypergraphs
Regular Partitions of Hypergraphs: Regularity Lemmas
Some Theorems on Abstract Graphs
Concentration of multivariate polynomials and its applications