On (K_{q},k) stable graphs with small k
Résumé
A graph G is (K_{q},k) (vertex) stable if it contains a copy of K_{q} after deleting any subset of k vertices. We show that for q >= 6 and k <= q/2 + 1 the only (K_q,k) stable graph with minimum size is isomorphic to K_{q+k}.
Domaines
Mathématique discrète [cs.DM]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...