HMMT 2009 S5
- Team 2
- Answer
A -clique of a graph is a set of vertices such that all pairs of vertices in the clique are adjacent. The clique number of a graph is the size of the largest clique in the graph. Does there exist a graph which has a clique number smaller than its chromatic number?
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
2
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.