A generalization of the Erdős-Ko-Rado theorem
From MaRDI portal
Publication:1045161
DOI10.1016/j.disc.2009.07.020zbMath1181.05033arXiv0902.3770MaRDI QIDQ1045161
Hossein Hajiabolhassan, Meysam Alishahi, Ali Taherkhani
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0902.3770
maximum independent sets; Erdős-Ko-Rado theorem; graph homomorphism; Kneser graph; local chromatic number
05C35: Extremal problems in graph theory
05C15: Coloring of graphs and hypergraphs
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Cites Work
- Unnamed Item
- Kneser's conjecture, chromatic number, and homotopy
- Local chromatic number, Ky Fan's theorem, and circular colorings
- Homomorphisms of 3-chromatic graphs
- Coloring graphs with locally few colors
- Local chromatic number of quadrangulations of surfaces
- Local chromatic number and Sperner capacity
- Locally restricted colorings
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A note on the star chromatic number
- Local chromatic number and distinguishing the strength of topological obstructions