Strong complete immersions in graphs with independence number two
math.CO
Submitted: 2026-10-31
Updated: 2026-10-31
Terminology
Sources
- Manipulating the outcome of stable matching and roommates problems
- Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
- The Abu-Khzam$\unicode{x2013}$Langston Conjecture for Graphs with $\alpha(G) = 2$
- Coloring graphs with independence number two and no odd clique immersions
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