Two-point concentration for graph classes admitting sparse vertex deletion
math.CO, math.PR
Submitted: 2026-10-30
Updated: 2026-10-30
Terminology
Sources
- A note on Two-Point Concentration of the Independence Number of $G_{n,m}$
- Concentration of the maximum size of an induced subtree in moderately sparse random graphs
- Concentration of the largest induced tree size of $G_{n,p}$ around the standard expectation threshold
- The largest $K_r$-free set of vertices in a random graph
- Two-Point Concentration of the Domination Number of Random Graphs
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