MathDB
A Graph Maximum Problem

Source: 2018 China TST 3 Day 1 Problem 2

March 27, 2018
combinatoricsTSTgraph theory

Problem Statement

Let GG be a simple graph with 100 vertices such that for each vertice uu, there exists a vertice vāˆˆN(u)v \in N \left ( u \right ) and N \left ( u \right ) \cap N \left ( v \right ) = \o . Try to find the maximal possible number of edges in GG. The N(.) N \left ( . \right ) refers to the neighborhood.
Back to ProblemsView on AoPS