On the chromatic number of general Kneser hypergraphs

DOI10.1016/J.JCTB.2015.05.010MaRDI QIDQ490992zbMATH OpenOpenAlexFDO

Authors Meysam Alishahi, Hossein Hajiabolhassan

Publication date 21 August 2015

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1302.5394

zbMATH Keywords

chromatic numberKneser hypergraphs\(Z_p\)-Tucker lemmaTucker-Ky Fan's lemma

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Abstract: In this paper, in view of $Z_p$-Tucker lemma, we introduce a lower bound for chromatic number of Kneser hypergraphs which improves Dol'nikov-K{v{r}}{'{i}}{v{z}} bound. Next, we introduce multiple Kneser hypergraphs and we specify the chromatic number of some multiple Kneser hypergraphs. For a vector of positive integers $vecs=(s_1,s_2,ldots,s_m)$ and a partition $pi=(P_1,P_2,ldots,P_m)$ of $1,2,ldots,n$, the multiple Kneser hypergraph ${mKG}^r(pi;vecs;k)$ is a hypergraph with the vertex set ${\displaystyle }$V=left{A: Asubseteq P_1cup P_2cupcdots cup P_m, |A|=k, forall 1leq ileq m; |Acap P_i|leq s_i ight}${\displaystyle }$ whose edge set is consist of any $r$ pairwise disjoint vertices. We determine the chromatic number of multiple Kneser hypergraphs provided that $r=2$ or for any $1leqileqm$, we have $|P_i|leq2s_i$. A subset $Ssubseteq[n]$ is almost $s$-stable if for any two distinct elements $i,jinS$, we have $|i-j|geqs$. The almost $s$-stable Kneser hypergraph ${mKG}^r(n,k{)}_{s-stab}^{sim}$ has all $s$-stable subsets of $[n]$ as the vertex set and every $r$-tuple of pairwise disjoint vertices forms an edge. Meunier [The chromatic number of almost stable Kneser hypergraphs. J. Combin. Theory Ser. A, 118(6):1820--1828, 2011] showed for any positive integer $r$, $chi({mKG}^r(n,k{)}_{2-stab}^{sim})=leftlceiln-r(k-1)overr-1ightceil$. We extend this result to a large family of Schrijver hypergraphs. Finally, we present a colorful-type result which confirms the existence of a completely multicolored complete bipartite graph in any coloring of a graph.

Recommendations

• Chromatic number of random Kneser hypergraphs
• Colorful subhypergraphs in Kneser hypergraphs
• On the chromatic number of almost stable general Kneser hypergraphs
• Chromatic numbers of stable Kneser hypergraphs via topological Tverberg-type theorems
• On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs

Cites work

• scientific article; zbMATH DE number 4075095 (Why is no real title available?)
• scientific article; zbMATH DE number 3672329 (Why is no real title available?)
• scientific article; zbMATH DE number 3561377 (Why is no real title available?)
• scientific article; zbMATH DE number 3102257 (Why is no real title available?)
• A combinatorical proof of Kneser's conjecture
• A generalization of Kneser's conjecture
• A generalization of Tucker's combinatorial lemma with topological applications
• A new coloring theorem of Kneser graphs
• A short proof for Chen's alternative Kneser coloring lemma
• A topological lower bound for the circular chromatic number of Schrijver graphs
• Box complexes, neighborhood complexes, and the chromatic number
• Circular chromatic number of Kneser graphs
• Circular chromatic number: A survey
• Circular coloring and Mycielski construction
• Colorful subgraphs in Kneser-like graphs
• Coloring graphs with locally few colors
• Colourful theorems and indices of homomorphism complexes
• Ein Satz über abelsche Gruppen mit Anwendungen auf die Geometrie der Zahlen
• Equivariant Cohomology and Lower Bounds for Chromatic Numbers
• Evenly distributed subsets of \(S^ n\) and a combinatorial application
• Fractional multiples of graphs and the density of vertex-transitive graphs
• Generalized Kneser coloring theorems with combinatorial proofs
• Kneser representations of graphs
• Kneser's conjecture, chromatic number, and homotopy
• Local chromatic number, Ky Fan's theorem, and circular colorings
• Multichromatic numbers, star chromatic numbers and Kneser graphs
• Recent developments in circular colouring of graphs
• Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodým property
• The Chromatic Number of Kneser Hypergraphs
• The chromatic covering number of a graph
• The chromatic number of almost stable Kneser hypergraphs
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler

Cited in

(28)

• Lower bounds for the chromatic number of certain Kneser-type hypergraphs
• Topological bounds for graph representations over any field
• On the generalized Erdős-Kneser conjecture: proofs and reductions
• On the chromatic number of generalized Kneser hypergraphs
• Colorful subhypergraphs in Kneser hypergraphs
• On the number of star‐shaped classes in optimal colorings of Kneser graphs
• On the chromatic number of Kneser hypergraphs
• Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
• Dold's theorem from viewpoint of strong compatibility graphs
• Coloring hypercomplete and hyperpath graphs
• On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs
• Chromatic number via Turán number
• A new lower bound for the chromatic number of general Kneser hypergraphs
• Altermatic number of categorical product of graphs
• Intersection patterns of finite sets and of convex sets
• On chromatic number and minimum cut
• Coloring properties of categorical product of general Kneser hypergraphs
• On the chromatic number of matching Kneser graphs
• On the chromatic number of a subgraph of the Kneser graph
• Hedetniemi's conjecture for Kneser hypergraphs
• Colorful subhypergraphs in uniform hypergraphs
• Strengthening topological colorful results for graphs
• New construction of graphs with high chromatic number and small clique number
• The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs
• Concerning a conjecture on matching Kneser graphs
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
• Chromatic number of random Kneser hypergraphs
• Circular chromatic number of induced subgraphs of Kneser graphs

This page was built for publication: On the chromatic number of general Kneser hypergraphs

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