throwing out any vertex there is a n-clique prove that there is a n+1-clique
Source: 239 2001 J8
May 20, 2020
graph theorycombinatorics
Problem Statement
In a graph with vertices throwing out any vertex the remaining graph has a complete subgraph with vertices. Prove that the initial graph has a complete subgraph with vertices.