Stable sets of maximal size in Kneser-type graphs

DOI10.1016/J.EJC.2003.10.006zbMATH Open1048.05078OpenAlexW2084490360WikidataQ105583611 ScholiaQ105583611MaRDI QIDQ1827339FDOQ1827339

Authors: Benoît Larose, Claudia Malvenuto 

Publication date: 6 August 2004

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2003.10.006

Recommendations

• Maximum stable sets in analogs of Kneser and complete graphs
• On the number of vertices belonging to all maximum stable sets of a graph
• Combinatorial properties of the family of maximum stable sets of a graph
• The number of all stable sets in some classes of graphs
• Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs
• scientific article; zbMATH DE number 1792601
• On graphs whose maximal cliques and stable sets intersect
• A stability theorem for maximal \(K_{r+1}\)-free graphs
• On \((C_n;k)\) stable graphs
• A min-max relation for stable sets in graphs with no odd-\(K_ 4\)

zbMATH Keywords

Cayley graphsKneser graphsPermutation graphsVertex-transitive graphsStable sets

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Extremal set theory (05D05)

Cites Work

• Homomorphisms of 3-chromatic graphs
• Title not available (Why is that?)
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Kneser's conjecture, chromatic number, and homotopy
• On the maximum number of permutations with given maximal or minimal distance
• Projectivity and independent sets in powers of graphs
• Title not available (Why is that?)
• Applications of product colouring
• Intersecting families of permutations
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Graph products, Fourier analysis and spectral techniques

Cited In (62)

• On the Erdos-Ko-Rado property of finite groups of order a product of three primes
• On Disjoint Cross Intersecting Families of Permutations
• Intersection theorems for finite general linear groups
• Cliques in derangement graphs for innately transitive groups
• Intersection density of imprimitive groups of degree \(pq\)
• On the intersection spectrum of \(\mathrm{PSL}_2(q)\)
• On the EKR-module property
• The Erdős-Ko-Rado theorem for the derangement graph of the projective general linear group acting on the projective space
• On the intersection density of primitive groups of degree a product of two odd primes
• On maximum intersecting sets in direct and wreath product of groups
• The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations
• An Erdős-Ko-Rado theorem for the group \(\mathrm{PSU}(3, q)\)
• The number of all stable sets in some classes of graphs
• Structure of independent sets in direct products of some vertex-transitive graphs
• Characterization of intersecting families of maximum size in \(\mathrm{PSL}(2,q)\)
• An analogue of the Erdős-Ko-Rado theorem for weak compositions
• Erdős-Ko-Rado theorems for permutations and set partitions
• On the intersection density of the symmetric group acting on uniform subsets of small size
• Cross-intersecting families and primitivity of symmetric systems
• Setwise intersecting families of permutations
• Theorems of Erdős-Ko-Rado type in geometrical settings
• Cross-intersecting families of permutations
• On extracting maximum stable sets in perfect graphs using Lovász's theta function
• Title not available (Why is that?)
• An Erdős-Ko-Rado theorem for permutations with fixed number of cycles
• On \(r\)-cross \(t\)-intersecting families for weak compositions
• A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
• The automorphism group of the \(s\)-stable Kneser graphs
• An Erdős-Ko-Rado theorem for finite 2-transitive groups
• A new proof for the Erdős-Ko-Rado theorem for the alternating group
• An Erdős-Ko-Rado theorem for the derangement graph of PGL(\(2,q\)) acting on the projective line
• An Erdős--Ko--Rado theorem for partial permutations
• The Erdős-Ko-Rado property for some 2-transitive groups
• On the Erdős-Ko-Rado property for finite groups
• An Erdős-Ko-Rado-type theorem in Coxeter groups.
• On the largest intersecting set in \(\mathrm{GL}_2(q)\) and some of its subgroups
• On the number of vertices belonging to all maximum stable sets of a graph
• Largest independent sets of certain regular subgraphs of the derangement graph
• A Deza-Frankl type theorem for set partitions
• On \(t\)-intersecting families of signed sets and permutations
• Maximum stable sets in analogs of Kneser and complete graphs
• Eigenvalues of the derangement graph
• The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities
• A non-trivial intersection theorem for permutations with fixed number of cycles
• Some Erdős-Ko-Rado theorems for injections
• Stability for intersecting families in \(\mathrm{PGL}(2,q)\)
• On complete multipartite derangement graphs
• Erdős-Ko-Rado theorem for irreducible imprimitive reflection groups
• Setwise intersecting families in classical Coxeter groups
• Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations
• Intersecting families in classical Coxeter groups
• On triangles in derangement graphs
• 3-setwise intersecting families of the symmetric group
• Forbidding just one intersection, for permutations
• Independent sets of maximal size in tensor powers of vertex-transitive graphs
• Invitation to intersection problems for finite sets
• Strongly intersecting integer partitions
• Intersecting families of permutations
• A quasi-stability result for dictatorships in \(S_n\)
• Fourier analysis and large independent sets in powers of complete graphs
• Complete intersection problems for finite permutations
• Intersection theorem for finite permutations

This page was built for publication: Stable sets of maximal size in Kneser-type graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827339)