MathDB
Miklós Schweitzer 2004, Problem 2

Source: Miklós Schweitzer 2004

July 30, 2016
college contestsMiklos Schweitzergraph theory

Problem Statement

Write t(G)t(G) for the number of complete quadrilaterals in the graph GG and eG(S)e_G(S) for the number of edges spanned by a subset SS of vertices of GG. Let G1,G2G_1, G_2 be two (simple) graphs on a common underlying set VV of vertices, Vn|V|-n, and assume that eG1(S)eG2(S)<n21000|e_{G_1}(S)-e_{G_2}(S)|<\frac{n^2}{1000} holds for any subset SVS\subseteq V. Prove that t(G1)t(G2)n41000|t(G_1)-t(G_2)|\le \frac{n^4}{1000}.