2-factors in dense graphs (Q1917480)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: 2-factors in dense graphs |
scientific article; zbMATH DE number 897564
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 2-factors in dense graphs |
scientific article; zbMATH DE number 897564 |
Statements
2-factors in dense graphs (English)
0 references
7 July 1996
0 references
In 1978, Sauer and Spencer proposed the following conjecture: Any graph with \(n\) vertices and minimum degree at least \({2\over 3} n\) contains every graph \(H\) on \(n\) vertices with maximum degree at most 2. This paper proves that the conjecture is true for sufficiently large \(n\).
0 references
triangle
0 references
factor
0 references
bipartite
0 references
degree
0 references
0 references
0.90555084
0 references
0 references
0 references
0 references
0 references
