Exact local spectral thresholds for loose and tight Hamilton cycles in 3-graphs
math.CO
Submitted: 2026-11-09
Updated: 2026-11-09
Terminology
Sources
- Generalized Nordhaus--Gaddum Inequalities for Eigenvalues
- Exact minimum co-degree conditions for $\ell$-Hamiltonicity in hypergraphs
- Limits of CSP Problems and Efficient Parameter Testing
- Loose Hamiltonicity
- A hypergraph bandwidth theorem
- Tight Hamiltonicity from dense links of triples
- A local spectral condition for perfect matchings in 3-graphs
- A spectral condition for perfect matchings in 3-partite 3-graphs
- On the codegree threshold for Hamilton $\ell$-cycles in $k$-uniform hypergraphs
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality