Stable sets of maximal size in Kneser-type graphs
From MaRDI portal
(Redirected from Publication:1827339)
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\)
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3957109 (Why is no real title available?)
- Applications of product colouring
- Graph products, Fourier analysis and spectral techniques
- Homomorphisms of 3-chromatic graphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersecting families of permutations
- 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
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
Cited in
(62)- The Erdős-Ko-Rado theorem for the derangement graph of the projective general linear group acting on the projective space
- On the Erdos-Ko-Rado property of finite groups of order a product of three primes
- 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
- An Erdős-Ko-Rado theorem for the group \(\mathrm{PSU}(3, q)\)
- The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations
- 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 Disjoint Cross Intersecting Families of Permutations
- Cross-intersecting families and primitivity of symmetric systems
- On the intersection density of the symmetric group acting on uniform subsets of small size
- Setwise intersecting families of permutations
- Intersection theorems for finite general linear groups
- 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
- An Erdős-Ko-Rado theorem for permutations with fixed number of cycles
- scientific article; zbMATH DE number 5781390 (Why is no real title available?)
- On \(r\)-cross \(t\)-intersecting families for weak compositions
- An Erdős-Ko-Rado theorem for finite 2-transitive groups
- A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
- 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.
- The automorphism group of the \(s\)-stable Kneser graphs
- A new proof for the Erdős-Ko-Rado theorem for the alternating group
- 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
- Cliques in derangement graphs for innately transitive groups
- A Deza-Frankl type theorem for set partitions
- Intersection density of imprimitive groups of degree \(pq\)
- On t-intersecting families of signed sets and permutations
- Eigenvalues of the derangement graph
- Maximum stable sets in analogs of Kneser and complete graphs
- 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
- On the intersection spectrum of \(\mathrm{PSL}_2(q)\)
- Setwise intersecting families in classical Coxeter groups
- Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations
- On the EKR-module property
- On triangles in derangement graphs
- Intersecting families in classical Coxeter groups
- 3-setwise intersecting families of the symmetric group
- Forbidding just one intersection, for permutations
- Invitation to intersection problems for finite sets
- Strongly intersecting integer partitions
- Independent sets of maximal size in tensor powers of vertex-transitive graphs
- A quasi-stability result for dictatorships in \(S_n\)
- Intersecting families of permutations
- 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)
