\(3n-5\) edges do force a subdivision of \(K_5\) (Q1307446)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1355182
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(3n-5\) edges do force a subdivision of \(K_5\) |
scientific article; zbMATH DE number 1355182 |
Statements
\(3n-5\) edges do force a subdivision of \(K_5\) (English)
0 references
31 October 1999
0 references
It is shown that a graph on at least 3 vertices and with \(3n-5\) edges contains a subdivision of \(K_5\). This was conjectured by Dirac in 1964. The proof is fairly involved.
0 references
extremal graph theory
0 references
0.9276857376098632
0 references
0.9135113954544068
0 references
0.8694813251495361
0 references
0.8691607713699341
0 references
