Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
F\'abio Botler, Cristina G. Fernandes, Carla N. Lintzmayer, Rui A. Lopes, Suchismita Mishra, Bruno L. Netto, Maycon Sambinelli

TL;DR
This paper proves that graphs with independence number 2, bounded maximum degree, and limited clique covering contain immersions of complete graphs matching their chromatic number, advancing understanding of the immersion analogue of Hadwiger's conjecture.
Contribution
It verifies Vergara's conjecture for graphs with independence number 2 under certain maximum degree and clique covering constraints, extending previous results.
Findings
Graphs with independence number 2 and bounded maximum degree contain large clique immersions.
The result applies to graphs with maximum degree less than 2n/3 - 1 and clique covering number at most 3.
Improves bounds on maximum degree for the existence of complete graph immersions in such graphs.
Abstract
An immersion of a graph in a graph is a minimal subgraph of for which there is an injection and a set of edge-disjoint paths in such that the end vertices of are precisely and . The immersion analogue of Hadwiger Conjecture (1943), posed by Lescure and Meyniel (1985), asks whether every graph contains an immersion of . Its restriction to graphs with independence number 2 has received some attention recently, and Vergara (2017) raised the weaker conjecture that every graph with independence number 2 has an immersion of . This implies that every graph with independence number 2 has an immersion of . In this paper, we verify Vergara Conjecture for graphs with bounded maximum degree. Specifically, we prove that if is a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · Graph Labeling and Dimension Problems
