Turing universality, computability, and incompleteness in hypergraph Tur'an theory
math.CO, math.LO
Submitted: 2026-09-03
Updated: 2026-11-12
Terminology
Sources
- Strong stability from vertex-extendability and applications in generalized Tur'{a}n problems
- On a hypergraph Mantel theorem
- The number $4/9$ is a non-jump for $3$-graphs
- Intervals of hypergraph Tur'an densities
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