Colorings of \(b\)-simple hypergraphs
From MaRDI portal
Publication:1689874
DOI10.1016/j.endm.2017.06.017zbMath1378.05040OpenAlexW2742589421MaRDI QIDQ1689874
Margarita Akhmejanova, Dmitriy A. Shabanov
Publication date: 18 January 2018
Full work available at URL: https://doi.org/10.1016/j.endm.2017.06.017
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)
Related Items (5)
Equitable colorings of hypergraphs with \(r\) colors ⋮ Panchromatic 3-colorings of random hypergraphs ⋮ The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets ⋮ Extremal problems in hypergraph colourings ⋮ Equitable colorings of hypergraphs with few edges
Cites Work
- Improved algorithms for colorings of simple hypergraphs and applications
- Greedy colorings of uniform hypergraphs
- Coloring uniform hypergraphs with few edges
- Constructions of sparse uniform hypergraphs with high chromatic number
- The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
- An application of Lovász' local lemma-A new lower bound for the van der Waerden number
- A note on random greedy coloring of uniform hypergraphs
- Multipass greedy coloring of simple uniform hypergraphs
- Improved bounds and algorithms for hypergraph 2-coloring
- Colorings of hypergraphs with large number of colors
- Unnamed Item
This page was built for publication: Colorings of \(b\)-simple hypergraphs