Question

(a) x(G) 3 d +1 b) some stable set in G has size > n Does either (a) or (b) necessarily hold when (i) d is the maximum degree of G? (ii) d is the maximum, over all non-null subgraphs H of G, of the minimum degree of H? (iii) d is the average degree of G?

Answer 1

Date IS c prove that fellwnesult G outputs o ndepenle se Such tha+ 어.aY node m the sph Same nede V eS neighbo Since -,+ hos at most neighbo Hence Sine v VISI dUs ue hove Heme the Pore thd If G has sie % ds momum deee of G Hof G ơf the minimum ort'grte of H t is butele'ng that 3-1 His subyrPhol 6 degree c H

Date Page i)d is the overuge deasce o -)--TuranS-theorem- Shous +hat the indernd the d is the averge desree of G.