Independent sets of maximal size in tensor powers of vertex-transitive graphs
From MaRDI portal
Publication:3633011
DOI10.1002/jgt.20359zbMath1211.05119MaRDI QIDQ3633011
Benjamin B. McMillan, Cheng Yeaw Ku
Publication date: 16 June 2009
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20359
05C35: Extremal problems in graph theory
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Intersecting Families in Symmetric Unions of Direct Products of Set Families, Independent sets in direct products of vertex-transitive graphs
Uses Software
Cites Work
- Unnamed Item
- Intersecting families in the alternating group and direct product of symmetric groups
- Homomorphisms of 3-chromatic graphs
- On the maximum number of permutations with given maximal or minimal distance
- Graph products, Fourier analysis and spectral techniques
- Stable sets of maximal size in Kneser-type graphs
- Independent sets in graph powers are almost contained in juntas
- Projectivity and independent sets in powers of graphs
- Intersecting families of permutations