Abstract
We give a short proof that every graph G without an odd K k -minor is O ( k log k ) -colorable. This was first proved by Geelen et al. [J. Geelen, B. Gerards, B. Reed, P. Seymour, A. Vetta, On the odd-minor variant of Hadwiger's conjecture, J. Combin. Theory Ser. B 99 (1) (2009) 20–29]. We give a considerably simpler and shorter proof following their approach.
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 callDisclaimer: 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.
