The Borodin--Kostochka inequality from degree 750
math.CO
Submitted: 2026-11-02
Updated: 2026-11-06
Terminology
Sources
- The maximum number of perfect matchings in graphs with a given degree sequence
- Coloring a graph with $\Delta-1$ colors: Conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker
- On Borodin-Kostochka conjecture for correspondence coloring
- On the Borodin--Kostochka conjecture for graphs with large maximum degree
- Coloring graphs with dense neighborhoods
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