Independence number and odd dominating models
math.CO
Submitted: 2026-11-08
Updated: 2026-11-10
Terminology
Sources
- Disproof of the Odd Hadwiger Conjecture
- Verifying Hadwiger's Conjecture for Examples of Graphs with $\alpha(G) = 2$
- Two Relaxations of the Dominating Hadwiger's Conjecture
- Dominating $K_t$-Models
- Odd clique minors in graphs with independence number two
- Dominating Hadwiger's Conjecture for graphs $G$ with $\alpha(G)=2$
- Dominating Hadwiger's Conjecture holds for all $2K_2$-free 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