Skip to Main content Skip to Navigation
New interface
Journal articles

On the odd-minor variant of Hadwiger's conjecture

Jim Geelen 1 Bert Gerards 1 Bruce Reed Paul Seymour 1 Adrian Vetta 1 
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : A Kl-expansion consists of l vertex-disjoint trees, every two of which are joined by an edge. We call such an expansion odd if its vertices can be two-coloured so that the edges of the trees are bichromatic but the edges between trees are monochromatic. We show that, for every l, if a graph contains no odd Kl-expansion then its chromatic number is View the MathML source. In doing so, we obtain a characterization of graphs which contain no odd Kl-expansion which is of independent interest. We also prove that given a graph and a subset S of its vertex set, either there are k vertex-disjoint odd paths with endpoints in S, or there is a set X of at most 2kâˆ'2 vertices such that every odd path with both ends in S contains a vertex in X. Finally, we discuss the algorithmic implications of these results.
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Alain Monteil Connect in order to contact the contributor
Submitted on : Thursday, March 7, 2013 - 11:22:20 AM
Last modification on : Thursday, August 4, 2022 - 4:52:44 PM
Long-term archiving on: : Sunday, April 2, 2017 - 7:28:16 AM


Files produced by the author(s)


  • HAL Id : hal-00795995, version 1



Jim Geelen, Bert Gerards, Bruce Reed, Paul Seymour, Adrian Vetta. On the odd-minor variant of Hadwiger's conjecture. Journal of Combinatorial Theory, Series B, 2009, 99, pp.20―29. ⟨hal-00795995⟩



Record views


Files downloads