Graph Coloring and Ramsey Theory
0/109 solved1 / 109
Each question is graded on a single answer: a check that this chapter's methods work, not a test of the reasoning behind them.
Compute , the chromatic number of the complete graph on vertices.
Your answer
comb-gcol-20All Combinatorics chaptersAbout these 109 questions
Colouring vertices and edges, the chromatic number and its bounds, and the Ramsey results that make disorder impossible. This set covers the chapter Graph Coloring and Ramsey Theory in Combinatorics: 35 easy, 54 medium and 20 hard questions, each graded instantly with a hint and a full step-by-step solution. Progress is saved in this browser only.
- Proper Colourings and the Chromatic Number — 12 questions
- Bounds on the Chromatic Number — 12 questions
- The Chromatic Polynomial — 13 questions
- Applications: Scheduling, Registers and Maps — 13 questions
- Edge Colourings and Vizing's Theorem — 12 questions
- Ramsey Numbers — 12 questions
- Bounding the Ramsey Numbers — 12 questions
- Infinite Ramsey Theory — 11 questions
- Van der Waerden, Schur and the Ramsey Family — 12 questions