The Komlós conjecture for graphs of girth 7 (Q1972153): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q123357099, #quickstatements; #temporary_batch_1705514146057 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q123357099 / rank | |||
Normal rank | |||
Revision as of 20:03, 17 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Komlós conjecture for graphs of girth 7 |
scientific article |
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
