We introduce a family of vertex-transitive graphs with specified subgroups of automorphisms which generalise Kneser graphs, powers of complete graphs and Cayley graphs of permutations. We compute the stability ratio for a wide class of these. Under certain conditions we characterise their stable sets of maximal size. (C) 2003 Elsevier Ltd. All rights reserved.
Stable sets of maximal size in Kneser-type graphs / Benoit, Larose; Malvenuto, Claudia. - In: EUROPEAN JOURNAL OF COMBINATORICS. - ISSN 0195-6698. - STAMPA. - 25:5(2004), pp. 657-673. [10.1016/j.ejc.2003.10.006]
Stable sets of maximal size in Kneser-type graphs
MALVENUTO, Claudia
2004
Abstract
We introduce a family of vertex-transitive graphs with specified subgroups of automorphisms which generalise Kneser graphs, powers of complete graphs and Cayley graphs of permutations. We compute the stability ratio for a wide class of these. Under certain conditions we characterise their stable sets of maximal size. (C) 2003 Elsevier Ltd. All rights reserved.File allegati a questo prodotto
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
