Prescribed Color Patterns in Tight Hamilton Cycles and Spanning Trees
math.CO
Submitted: 2026-11-05
Updated: 2026-11-05
Terminology
Sources
- A bandwidth theorem for graph transversals
- Universality for transversal Hamilton cycles in random graphs
- Universality for transversal powers of Hamilton cycles
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