olymmath

SCHWEITZER 2004 Problem 2

    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, ∣V∣−n|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 S⊆VS\subseteq V . Prove that ∣t(G1)−t(G2)∣≤n41000|t(G_1)-t(G_2)|\le \frac{n^4}{1000} .

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator schweitzer/2004/p2 · Tag 6XZS82J9X4 · Edit this page on GitHub · Keys: j next, k previous