Question

Let G be a simple graph with 2n, n 2 vertices. Suppose there are at least n2 1 edges. Show that at least one triangle is formed. Hint: Check n 2 first and then use induction

Answer 1

Pn) be Lel the Taph with 2n edgas has atleast verices at least har then It One that Pn) iu Tru to want prove We Base case when Vertices 4 on = The araph has edgas atleast with 4 with the graph Note hat edgor maximum 6 6 Verticas has A one Removal From this givas tho graph it edges verlices 4 wifh iYemoved AB, Ac, AD one BCD Still have ta triangle we c)

removed If ne CB, CD ABD riangle the have we have BD Hhe triangle ABC So, P a)isTrue Inducion: Assume Tue vertices iThe graph 2n has edges hiangla 2 at least with at least a Phe graph usit 2) Con sider 2 atleast ) with Veicas, edqes (E) EG So, Ent) adjacent eticas Con Sider two L and v. this in g.roph

have both u and V then to edge Some form will Vertices Hhese 3 triangle have the Suppose we don't u and v . tviangle iavolving edgas tasting That no aYe From and Starting V frem vext2x the Same maak n 2 C1) otheY There -2 vertices So, maximum number the to edges Arom 2) verticas other - 2 = 2 1N 2n.

number edges Let Hhe Othar verHcos from to be e' So than If ha rasulting gvaph sith 2n verticas, il have edgas E -e- t Fotal umber uhere 2. 2daes number 6 e ther 2n edges from e s 2 vextice edge and for the between e v. F - e-

2 2 - 2n -I n +20 + +( - 2n -1 2 n +) E - 2- Yemove If graph t at least we got Hha 2 with verhices edyas assunphon This mut have triangla at least PCnti)i True Pn) iTrua ¥n2 By induchion