MathDB
two triangles with a common edge [variation on Turan]

Source: China TST 1987, problem 6

May 16, 2005
inductioncombinatorics unsolvedcombinatorics

Problem Statement

Let G G be a simple graph with 2n 2 \cdot n vertices and n2+1 n^{2}+1 edges. Show that this graph G G contains a K4one edge K_{4}-\text{one edge}, that is, two triangles with a common edge.