Clique minors in Cartesian products of graphs

MaRDI QIDQ416762zbMATH OpenFDO

Authors David R. Wood

Publication date 10 May 2012

Published in The New York Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0711.1189, http://www.emis.de/journals/NYJM/j/2011/17-28.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Cartesian productgraph minor

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76) Graph minors (05C83)

Abstract: A "clique minor" in a graph G can be thought of as a set of connected subgraphs in G that are pairwise disjoint and pairwise adjacent. The "Hadwiger number" h(G) is the maximum cardinality of a clique minor in G. This paper studies clique minors in the Cartesian product G*H. Our main result is a rough structural characterisation theorem for Cartesian products with bounded Hadwiger number. It implies that if the product of two sufficiently large graphs has bounded Hadwiger number then it is one of the following graphs: - a planar grid with a vortex of bounded width in the outerface, - a cylindrical grid with a vortex of bounded width in each of the two `big' faces, or - a toroidal grid. Motivation for studying the Hadwiger number of a graph includes Hadwiger's Conjecture, which states that the chromatic number chi(G) <= h(G). It is open whether Hadwiger's Conjecture holds for every Cartesian product. We prove that if |V(H)|-1 >= chi(G) >= chi(H) then Hadwiger's Conjecture holds for G*H. On the other hand, we prove that Hadwiger's Conjecture holds for all Cartesian products if and only if it holds for all G * K_2. We then show that h(G * K_2) is tied to the treewidth of G. We also develop connections with pseudoachromatic colourings and connected dominating sets that imply near-tight bounds on the Hadwiger number of grid graphs (Cartesian products of paths) and Hamming graphs (Cartesian products of cliques).

Recommendations

• Hadwiger number and the Cartesian product of graphs
• Clique minors in claw-free graphs
• On the Hadwiger's conjecture for graph products
• On the Colin de Verdière numbers of Cartesian graph products
• THE CLIQUE MINOR OF GRAPHS WITH INDEPENDENCE NUMBER TWO

Cited in

(14)

• Track layouts, layered path decompositions, and leveled planarity
• Notes on graph product structure theory
• Layered separators in minor-closed graph classes with applications
• Parameters tied to treewidth
• Hadwiger's conjecture for -link graphs
• Treewidth of Cartesian products of highly connected graphs
• Minors and strong products
• Clique immersion in graph products
• Characterisations and examples of graph classes with bounded expansion
• Polynomial treewidth forces a large grid-like-minor
• Grid minors and products
• Structural properties of graph products
• Lower bounds for treewidth of product graphs
• A note on graph minors and strong products

This page was built for publication: Clique minors in Cartesian products of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q416762)