\((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs
From MaRDI portal
DOI10.1016/j.dam.2014.11.029zbMath1408.05058arXiv1402.3057OpenAlexW2038918819MaRDI QIDQ2341713
Yair Caro, Josef Lauri, Christina Zarb
Publication date: 28 April 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.3057
Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs
- Color-bounded hypergraphs. I: General results
- Bicoloring Steiner triple systems
- Pseudo-chordal mixed hypergraphs
- Voloshin's colourings of \(P_{3}\)-designs
- Coloring mixed hypergraphs: theory, algorithms and applications
- Bicolouring Steiner systems \(S\)(2,4,\(v\))
- On the construction of 3-chromatic hypergraphs with few edges
- Constructions of sparse uniform hypergraphs with high chromatic number
- Extending bicolorings for Steiner triple systems