The Komlós conjecture for graphs of girth 7 (Q1972153): Difference between revisions

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.