Edge-coloring spectra of odd-fold graph covers and counterexamples to a conjecture
math.CO
Submitted: 2026-11-10
Updated: 2026-11-10
Comments: Comments are welcome!
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- A short proof of the Goldberg-Seymour conjecture
- On the Spectra of Chromatic Number and Chromatic Index of Cyclic Covers
- Integer Flows on Cyclic Covers of 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