« first day (3424 days earlier)      last day (910 days later) » 

Martin Sleziak
Martin Sleziak
5:06 AM
new-tag A new tag com was created. Maybe by mistake? (Although I am not sure what was intended there.)
0
Q: An explanation for a proof

M.RamanaThe theorem is: If a graph on $n$ vertices contains more than $\frac{n^2}{4}$ edges, then $G$ contains a triangle. At the beginning of the proof, the author's written: To avoid ceilings and floorings, we will prove the theorem for graphs on an even number $2n$ of vertices. Is there anybody to exp...

discrete-mathematics com
I have removed the tag (com) - I suppose you have created it by mistake. I suppose that since you are asking about a particular proof, maybe (proof-explanation) would be suitable. Certainly it would help to include where this specific proof can be found. Maybe you mean the proof of Theorem 4.7 in Jukna's Extremal Combinatorics? — Martin Sleziak 12 secs ago
I have also expanded a title to be more descriptive: An explanation for a proof that a graph with more than $n^2/4$ edges contains a triangle. (Although maybe it is too long now?)
 

« first day (3424 days earlier)      last day (910 days later) »