The Komlós–Sós conjecture for graphs of girth 7

If a graph has girth at least seven and half its vertices have degree at least k, then it contains all trees of size k.