Structure of independent sets in direct products of some vertex-transitive graphs

DOI10.1007/s10114-011-0311-5zbMath1334.05100OpenAlexW2023327064MaRDI QIDQ270290

Jun Wang, Xing Bo Geng, Hua Jun Zhang

Publication date: 7 April 2016

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-011-0311-5

zbMATH Keywords

independence numberprimitivityvertex transitivity

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Maximum independent sets in direct products of cycles or trees with arbitrary graphs, Intersecting Families in Symmetric Unions of Direct Products of Set Families, On 3-colorings of direct products of graphs, Fractional chromatic numbers of tensor products of three graphs, Independent sets in tensor products of three vertex-transitive graphs, Chromatic number via Turán number, On the Chromatic Number of Matching Kneser Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Cross-intersecting families and primitivity of symmetric systems
• An Erdős--Ko--Rado theorem for partial permutations
• Erdős-Ko-Rado-type theorems for colored sets
• Intersecting families in the alternating group and direct product of symmetric groups
• An Erdős-Ko-Rado-type theorem in Coxeter groups.
• A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
• Homomorphisms of 3-chromatic graphs
• On the maximum number of permutations with given maximal or minimal distance
• Graph products and the chromatic difference sequence of vertex-transitive graphs
• Stable sets of maximal size in Kneser-type graphs
• Independence and coloring properties of direct products of some vertex-transitive graphs
• An Erdös-Ko-Rado theorem for direct products
• Primitivity and independent sets in direct products of vertex-transitive graphs
• Projectivity and independent sets in powers of graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersecting families of permutations