On balanced colorings of hypergraphs
From MaRDI portal
Publication:548768
DOI10.1007/S10958-010-0067-YzbMATH Open1231.05140OpenAlexW1979883786MaRDI QIDQ548768FDOQ548768
A. P. Rozovskaya, Maria V. Titova, D. A. Shabanov
Publication date: 30 June 2011
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-010-0067-y
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Randomized algorithms for colourings of hypergraphs
- Extremal problems for colourings of uniform hypergraphs
- On a property of families of sets
- Improved bounds and algorithms for hypergraph 2-coloring
- On 3-chromatic hypergraphs
- On a combinatorial problem. II
- A Note on a Combinatorial Problem of ErdŐS and Hajnal
- On Property B of Families of Sets
- On general two-colorings of uniform hypergraphs
- On one combinatorial problem of Erdös
Cited In (9)
- Balanced allocation on hypergraphs
- Title not available (Why is that?)
- Split and balanced colorings of complete graphs
- Multiply balanced edge colorings of multigraphs
- On algorithmic methods of analysis of two-colorings of hypergraphs
- Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs
- Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs
- Balanced colourings of strongly regular graphs
- Balanced polychromatic 2-coloring of triangulations
This page was built for publication: On balanced colorings of hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548768)
