HMMT 2009 T4
- Team 1
A -clique of a graph is a set of vertices such that all pairs of vertices in the clique are adjacent. (a) [4] Find a graph with chromatic number 3 that does not contain any 3 -cliques.
Dataset text NuminaMath olympiads. 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.
Similar problems
These problems have the most words in common with this statement.