Hostname: page-component-74656f9884-rdgjk Total loading time: 0 Render date: 2026-11-07T01:05:07.570Z Has data issue: false hasContentIssue false

Two Minor Problems

Published online by Cambridge University Press:  28 April 2004

ANDREW THOMASON
Affiliation:
Department of Pure Mathematics and Mathematical Statistics, Centre for Mathematical Sciences, Wilberforce Road, Cambridge, CB3 0WB, United Kingdom (e-mail: A.G.Thomason@dpmms.cam.ac.uk)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

What simple condition on a graph $G$ will ensure that $G\,{\succ}\,K_t$? As usual, $G\,{\succ}\,K_t$ means that $K_t$ is a minor of the graph $G$ (in other words, $G$ has vertex disjoint connected subgraphs $W_1,\ldots,W_t$ and at least one edge between $W_i$ and $W_j$, $1\,{\le}\, i<j\,{\le}\, t$).

Information

Type
PROBLEM SECTION
Copyright
2004 Cambridge University Press