Statements (12)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:countryOfOrigin |
gptkb:Hungary
|
| gptkbp:field |
graph theory
|
| gptkbp:formedBy |
1964
|
| gptkbp:namedAfter |
gptkb:Vera_T._Sós
|
| gptkbp:relatedTo |
gptkb:Erdős–Gallai_theorem
cycle in graphs |
| gptkbp:sentence |
Every graph with n vertices and more than n^2/4 edges contains a cycle of length 2k for every 2 ≤ 2k ≤ n.
|
| gptkbp:status |
open
|
| gptkbp:bfsParent |
gptkb:Vera_T._Sós
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Sós conjecture
|