A Cameron-Goethals-Seidel-Shult theorem for marked graphs
math.CO
Submitted: 2026-11-09
Updated: 2026-11-09
Code: https://github.com/Chaohui-Chen/CGSS_
Terminology
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