GATE CS 2018 (Forenoon) — Question 28

Discrete MathematicsAdvanced Graph Bounds (Matching, Coloring Theorems)NAT1 markEasy

Challenge a friend: WhatsApp Telegram
From RENYXERAFree All-India Mock — every SundayA full GATE CS paper, exactly 180 minutes, ranked across India with your GATE score.
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