The Komlós conjecture for graphs of girth 7 (Q1972153)
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: The Komlós conjecture for graphs of girth 7 |
scientific article; zbMATH DE number 1423751
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Komlós conjecture for graphs of girth 7 |
scientific article; zbMATH DE number 1423751 |
Statements
The Komlós conjecture for graphs of girth 7 (English)
0 references
23 October 2000
0 references
The median degree of a graph \(G\) is the largest integer \(k\) such that at least half the vertices of \(G\) have degrees at least \(k\). The note shows that if \(G\) has girth at least seven and if its median degree is at least \(k\), then \(G\) contains as subgraphs all trees with \(k\) edges.
0 references
median degree
0 references
girth
0 references
trees
0 references
0.8822497
0 references
0.87381583
0 references
0.87348413
0 references
0.8714174
0 references
0.8709563
0 references
0.86934716
0 references
0.8665155
0 references
0.86468744
0 references
