Equitable two-colorings of uniform hypergraphs
From MaRDI portal
Publication:458597
DOI10.1016/j.ejc.2014.08.029zbMath1301.05244OpenAlexW2057350555MaRDI QIDQ458597
Publication date: 8 October 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2014.08.029
Hypergraphs (05C65) Parallel algorithms in computer science (68W10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
Equitable colorings of nonuniform hypergraphs ⋮ Equitable colorings of hypergraphs with \(r\) colors ⋮ On some generalizations of the property B problem of an \(n\)-uniform hypergraph ⋮ Equitable coloring of hypergraphs ⋮ Extremal problems in hypergraph colourings ⋮ On equitable colorings of hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast algorithm for equitable coloring
- On \(r\)-chromatic hypergraphs
- 2-colourings in \(S(t, t+1, v)\)
- Lopsided Lovász Local lemma and Latin transversals
- Using Lovász local lemma in the space of random injections
- On 3-chromatic hypergraphs
- Coloring n-sets red and blue
- Asymptotic lower bounds for Ramsey functions
- An Ore-type theorem on equitable coloring
- Coloring uniform hypergraphs with few edges
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- Improved bounds and algorithms for hypergraph 2-coloring
This page was built for publication: Equitable two-colorings of uniform hypergraphs