a special case of hadwigers conjecture：hadwiger猜想的一个特殊的情况下.pdfVIP

Journal of Combinatorial Theory, Series B 97 (2007) 1056–1073 /locate/jctb A special case of Hadwiger’s conjecture Jonah Blasiak Department of Mathematics, University of California, Berkeley, CA 94720, USA Received 12 August 2004 Available online 29 April 2007 Abstract We investigate Hadwiger’s conjecture for graphs with no stable set of size 3. Such a graph on at least 2t − 1 vertices is not t − 1 colorable, so is conjectured to have a Kt minor. There is a strengthening of Hadwiger’s conjecture in this case, which states that there is a Kt minor in which the preimage of each vertex of Kt is a single vertex or an edge. We prove this strengthened version for graphs with an even number of vertices and fractional clique covering number less than 3. We investigate several possible generalizations and obtain counterexamples for some and improved results from others. We also show that for sufficiently large n, a graph on n vertices with no stable set of size 3 has a K 1 4/5 minor using only vertices and single n 9 edges as preimages of vertices. © 2007 Elsevier Inc. All rights reserved. Keywords: Hadwiger’s conjecture; Complete minor; Fractional clique covering number; Matching 1. Introduction A graph H is a minor of a graph G if H can be obtained from a subgraph of G by contracting edges. If E is the set of contracted edges, we call a connected component of the graph (V (G), E) a prevertex . Upon contraction of E, each prevertex becomes a vertex of H . One of the most d