Colorful subhypergraphs in Kneser hypergraphs
From MaRDI portal
Publication:405073
zbMATH Open1300.05202arXiv1306.1112MaRDI QIDQ405073FDOQ405073
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Abstract: Using a -generalization of a theorem of Ky Fan, we extend to Kneser hypergraphs a theorem of Simonyi and Tardos that ensures the existence of multicolored complete bipartite graphs in any proper coloring of a Kneser graph. It allows to derive a lower bound for the local chromatic number of Kneser hypergraphs (using a natural definition of what can be the local chromatic number of a hypergraph).
Full work available at URL: https://arxiv.org/abs/1306.1112
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
combinatorial topologyKneser hypergraphscolorful complete \(p\)-partite hypergraphlocal chromatic number
Cites Work
- Title not available (Why is that?)
- On the diameter of Kneser graphs
- Kneser's conjecture, chromatic number, and homotopy
- The Chromatic Number of Kneser Hypergraphs
- Coloring graphs with locally few colors
- Colorful subgraphs in Kneser-like graphs
- Local chromatic number, Ky Fan's theorem, and circular colorings
- Title not available (Why is that?)
- n-tuple colorings and associated graphs
- Generalized Kneser coloring theorems with combinatorial proofs
- A combinatorical proof of Kneser's conjecture
- A generalization of Tucker's combinatorial lemma with topological applications
- Equivariant Cohomology and Lower Bounds for Chromatic Numbers
- A topological lower bound for the circular chromatic number of Schrijver graphs
- Topological lower bounds for the chromatic number: a hierarchy
- Combinatorial Stokes formulas via minimal resolutions
- Evenly distributed subsets of \(S^ n\) and a combinatorial application
- On the chromatic number of general Kneser hypergraphs
- The chromatic number of almost stable Kneser hypergraphs
Cited In (10)
- Coloring properties of categorical product of general Kneser hypergraphs
- Hedetniemi's conjecture for Kneser hypergraphs
- Chromatic number via Turán number
- Strengthening topological colorful results for graphs
- Title not available (Why is that?)
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Colorful subgraphs in Kneser-like graphs
- A new lower bound for the chromatic number of general Kneser hypergraphs
- Colorful subhypergraphs in uniform hypergraphs
- Altermatic number of categorical product of graphs
This page was built for publication: Colorful subhypergraphs in Kneser hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405073)
