Equitable two-colorings of uniform hypergraphs
From MaRDI portal
Recommendations
Cites work
- 2-colourings in S(t, t+1, v)
- A fast algorithm for equitable coloring
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- An Ore-type theorem on equitable coloring
- Asymptotic lower bounds for Ramsey functions
- Coloring n-sets red and blue
- Coloring uniform hypergraphs with few edges
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- Improved bounds and algorithms for hypergraph 2-coloring
- Lopsided Lovász Local lemma and Latin transversals
- On r-chromatic hypergraphs
- On 3-chromatic hypergraphs
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Using Lovász local lemma in the space of random injections
Cited in
(11)- Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs
- On 2-coloring certain k-uniform hypergraphs
- On equitable colorings of hypergraphs
- Equitable coloring of hypergraphs
- Equitable colorings of hypergraphs with \(r\) colors
- On some generalizations of the property B problem of an \(n\)-uniform hypergraph
- Equitable colorings of nonuniform hypergraphs
- Equitable Coloring ofk-Uniform Hypergraphs
- Extremal problems in hypergraph colourings
- scientific article; zbMATH DE number 2246595 (Why is no real title available?)
- Equitable orientations of sparse uniform hypergraphs
This page was built for publication: Equitable two-colorings of uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458597)