Recommendations
- On algorithmic methods of analysis of two-colorings of hypergraphs
- Combinatorial extremum problems for 2-colorings of hypergraphs
- On some generalizations of the property B problem of an \(n\)-uniform hypergraph
- 2-colorings of uniform hypergraphs
- On the construction of non-2-colorable uniform hypergraphs
Cites work
- A Note on a Combinatorial Problem of ErdŐS and Hajnal
- Extremal problems for colourings of uniform hypergraphs
- scientific article; zbMATH DE number 11977 (Why is no real title available?)
- scientific article; zbMATH DE number 786170 (Why is no real title available?)
- scientific article; zbMATH DE number 918337 (Why is no real title available?)
- scientific article; zbMATH DE number 2188343 (Why is no real title available?)
- Improved bounds and algorithms for hypergraph 2-coloring
- On 3-chromatic hypergraphs
- On a combinatorial problem. II
- On a property of families of sets
- On general two-colorings of uniform hypergraphs
- On one combinatorial problem of Erdös
- On Property B of Families of Sets
- Randomized algorithms for colourings of hypergraphs
Cited in
(21)- Split and balanced colorings of complete graphs
- Balanced colourings of strongly regular graphs
- Balanced polychromatic 2-coloring of triangulations
- DP-colorings of uniform hypergraphs and splittings of Boolean hypercube into faces
- Good and nice colorings of balanced hypergraphs
- Combinatorial extremum problems for 2-colorings of hypergraphs
- Equitable colorings of hypergraphs with \(r\) colors
- On some generalizations of the property B problem of an \(n\)-uniform hypergraph
- Multiply balanced edge colorings of multigraphs
- On algorithmic methods of analysis of two-colorings of hypergraphs
- scientific article; zbMATH DE number 4016947 (Why is no real title available?)
- On a 3-uniform hypergraph coloring problem in the integers
- scientific article; zbMATH DE number 568840 (Why is no real title available?)
- scientific article; zbMATH DE number 1759407 (Why is no real title available?)
- On the construction of non-2-colorable uniform hypergraphs
- On the vertex number of almost bipartite hypergraphs
- 2-colorings of uniform hypergraphs
- Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs
- Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs
- Balanced allocation on hypergraphs
- On two-colorings of hypergraphs
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)
