no. 7 · Tuesday 3 November 2026
Strong complete immersions in graphs with independence number two
Abstract
We prove that every graph $G$ with independence number at most two contains a strong immersion of $K_{χ(G)}$. This strengthens Dahlke's theorem for weak immersions and establishes the Lescure–Meyniel conjecture for this class of graphs.
- fields
- Combinatorics