GATE CS 2024 (Forenoon) — Question 51

Discrete MathematicsAdvanced Graph Bounds (Matching, Coloring Theorems)MSQ2 marksHard

The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. Let \( G \) be any graph with \( n \) vertices and chromatic number \( k \). Which of the following statements is/are always TRUE?
  1. A
    \( G \) contains a complete subgraph with \( k \) vertices
  2. B
    \( G \) contains an independent set of size at least \( \frac{n}{k} \).
  3. C
    \( G \) contains at least \( \frac{k(k - 1)}{2} \) edges
  4. D
    \( G \) contains a vertex of degree at least \( k \).
Practise the full 2024-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAPractise this subject in the exam simulatorTimed, GATE-style tests with analytics that find your weak topics.
Practise more on Advanced Graph Bounds (Matching, Coloring Theorems)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group