Tolerance complexes of chordal graphs and squarefree symbolic powers
math.CO
Submitted: 2026-11-10
Updated: 2026-11-10
Terminology
Sources
- Bounding the collapsibility number of simplicial complexes and graphs
- Admissible set and squarefree-power-like function with applications to squarefree symbolic powers
- Generalized Hamming weights and symbolic powers of Stanley-Reisner ideals of matroids
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