2-factors in dense graphs (Q1917480): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q199348 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Zhenhong Liu / rank | |||
Normal rank | |||
Revision as of 17:42, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 2-factors in dense graphs |
scientific article |
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
