Hostname: page-component-586b7cd67f-2brh9 Total loading time: 0 Render date: 2024-11-30T01:50:28.366Z Has data issue: false hasContentIssue false
  • English
  • Français

Two Minor Problems

Published online by Cambridge University Press:  28 April 2004

ANDREW THOMASON
ANDREW THOMASON
Affiliation:
Department of Pure Mathematics and Mathematical Statistics, Centre for Mathematical Sciences, Wilberforce Road, Cambridge, CB3 0WB, United Kingdom (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

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$).

Type
PROBLEM SECTION
Information
Combinatorics, Probability and Computing , Volume 13 , Issue 3 , May 2004 , pp. 413 - 414
Copyright
2004 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)