On Diameter Graphs Problems: A proof of Brass's Conjecture
math.CO, math.MG
Submitted: 2026-11-03
Updated: 2026-11-03
Code: https://github.com/maaxgrin/borsuk-63-counterexample
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