Abstract
The analogue of Hadwiger’s conjecture for the immersion relation states that every graph G contains an immersion of Kχ(G). For graphs with independence number 2, this is equivalent to stating that every such n-vertex graph contains an immersion of K⌈n/2⌉. We show that every n-vertex graph with independence number 2 contains every complete bipartite graph on ⌈n/2⌉ vertices as an immersion.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
