Abstract
A conjecture of Sauer and Spencer states that any graph G on n vertices with minimum degree at least 2/3 n contains any graph H on n vertices with maximum degree 2 or less. This conjecture is proven here for all sufficiently large n.
Original language | English (US) |
---|---|
Pages (from-to) | 13-23 |
Number of pages | 11 |
Journal | Discrete Mathematics |
Volume | 152 |
Issue number | 1-3 |
DOIs | |
State | Published - May 20 1996 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics