Stable sets of maximal size in Kneser-type graphs

Authors:
Benoit Larose;Claudia Malvenuto
Affiliations:
Department of Mathematics and Statistics, Concordia University, 1455 De Maisonneuve West, Montreal, Qc, Canada, H3G IM8;Dipartimento di Informatica, Università di Roma "La Sapienza", Via Salaria, 113, 00198 Roma, Italy
Venue:
European Journal of Combinatorics
Year:
2004

Citing 3
Cited 14

Combinatorics: set systems, hypergraphs, families of vectors, and combinatorial probability

Combinatorics: set systems, hypergraphs, families of vectors, and combinatorial probability
Intersecting families of permutations

European Journal of Combinatorics
Projectivity and independent sets in powers of graphs

Journal of Graph Theory

Fourier analysis and large independent sets in powers of complete graphs

Journal of Combinatorial Theory Series B
An Erdős-Ko-Rado-type theorem in Coxeter groups

European Journal of Combinatorics
Erdős--Ko--Rado theorems for permutations and set partitions

Journal of Combinatorial Theory Series A
Maximum stable sets in analogs of Kneser and complete graphs

European Journal of Combinatorics
A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations

European Journal of Combinatorics
Eigenvalues of the derangement graph

Journal of Combinatorial Theory Series A
Some Erdős-Ko-Rado theorems for injections

European Journal of Combinatorics
Note: Cross-intersecting families of permutations

Journal of Combinatorial Theory Series A
Cross-intersecting families and primitivity of symmetric systems

Journal of Combinatorial Theory Series A
An Erdős-Ko-Rado theorem for the derangement graph of PGL(2,q) acting on the projective line

Journal of Combinatorial Theory Series A
Cross-Intersecting Families of Partial Permutations

SIAM Journal on Discrete Mathematics
Intersection theorem for finite permutations

Problems of Information Transmission
Setwise intersecting families of permutations

Journal of Combinatorial Theory Series A
Nontrivial independent sets of bipartite graphs and cross-intersecting families

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

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.