On the Stability of the Independence Number of the Distance Graph G(n,r,<s) for Growing r and s
math.CO, math.PR
Submitted: 2026-10-12
Updated: 2026-11-07
Terminology
Sources
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