## Abstract The graph __G__ contains a graph __H__ as a __minor__ if there exist pairwise disjoint sets {__S__~__i__~ β __V__(__G__)|__i__β=β1,β¦,|__V__(__H__)|} such that for every __i__, __G__[__S__~__i__~] is a connected subgraph and for every edge __uv__ in __H__, there exists an edge of __G__ w
Subdivisions, linking, minors, and extremal functions
β Scribed by Andrew Thomason
- Book ID
- 108498139
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 261 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract In this paper we prove two results. The first is an extension of a result of Dirac which says that any set of __n__ vertices of an __n__βconnected graph lies in a cycle. We prove that if __V__β² is a set of at most 2__n__ vertices in an __n__βconnected graph __G__, then __G__ has, as a m
A probabilistic result of Bollobas and Catlin concerning the largest integer p so that a subdivision of K, is contained in a random graph is generalized to a result concerning the largest integer p so that a subdivision of A, is contained in a random graph for some sequence Al, A\*, . . . of graphs
It is proved that every graph G with G β₯ 2|G| -5, |G| β₯ 6, and girth at least 5, except the Petersen graph, contains a subdivision of K - 5 , the complete graph on five vertices minus one edge.