𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Unavoidable stars in 3-graphs

✍ Scribed by F.R.K. Chung

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
403 KB
Volume
35
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Unavoidable cycle lengths in graphs
Unavoidable cycle lengths in graphs
✍ Jacques Verstraete πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 160 KB

## Abstract An old conjecture of ErdΕ‘s states that there exists an absolute constant __c__ and a set __S__ of density zero such that every graph of average degree at least __c__ contains a cycle of length in __S__. In this paper, we prove this conjecture by showing that every graph of average degre

Graphs with unavoidable subgraphs with l
Graphs with unavoidable subgraphs with large degrees
✍ L. Caccetta; P. ErdΓΆs; K. Vijayan πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 360 KB

Let %(n, rn) denote the class of simple graphs on n vertices and rn edges and let G E %(n, rn). There are many results in graph theory giving conditions under which G contains certain types of subgraphs, such as cycles of given lengths, complete graphs, etc. For example, Turan's theorem gives a suff

Unavoidable parallel minors of 4-connect
Unavoidable parallel minors of 4-connected graphs
✍ Carolyn Chun; Guoli Ding; Bogdan Oporowski; Dirk Vertigan πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 154 KB

## Abstract A __parallel minor__ is obtained from a graph by any sequence of edge contractions and parallel edge deletions. We prove that, for any positive integer __k__, every internally 4‐connected graph of sufficiently high order contains a parallel minor isomorphic to a variation of __K__~4,__k

Coedge regular graphs without 3-stars
Coedge regular graphs without 3-stars
✍ V. V. Kabanov; A. A. Makhnev πŸ“‚ Article πŸ“… 1996 πŸ› SP MAIK Nauka/Interperiodica 🌐 English βš– 505 KB