Recent content by Mellete

Still having trouble showing that there is a vertex with degree less or equal to δ(Tr(p))

Homework Statement Homework, from Modern Graph Theory by Bela Bollobas, section on extremals: 1. Suppose that G is a graph with n > r + 1 vertices and tr(n) + 1 edges. (a) Prove that for every p with r + 1 < p <= n there is a subgraph H of G with |H| = p and e(H) >= tr(p) + 1. [Hint: Try to...