Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Loebl-Komlós-Sós conjecture
|
| gptkbp:namedAfter |
gptkb:Vera_T._Sós
Jaroslav Loebl Miklós Komlós |
| gptkbp:proposedBy |
gptkb:Vera_T._Sós
gptkb:Jaroslav_Nešetřil gptkb:Miklós_Simonovits Miklós Komlós |
| gptkbp:relatedTo |
gptkb:extremal_graph_theory
tree embedding |
| gptkbp:sentence |
Every graph with n vertices and at least n/2 vertices of degree at least k contains every tree with k edges as a subgraph.
|
| gptkbp:status |
open for general case
proven for large k |
| gptkbp:yearProposed |
1993
|
| gptkbp:bfsParent |
gptkb:Jerome_Loebl
|
| gptkbp:bfsLayer |
7
|