Diameter Bounds and Finiteness of Graphs from Local Intersection Data
math.CO
Submitted: 2026-10-27
Updated: 2026-11-07
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Sources
- More two-distance counterexamples to Borsuk's conjecture from strongly regular graphs
- An improved bound for strongly regular graphs with smallest eigenvalue $-m$
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