Cited in
(6)- 2-colorings of hypergraphs with large girth
- On balanced colorings of hypergraphs
- Extremal problems in hypergraph colourings
- Upper bound in the Erdős-Hajnal problem of hypergraph coloring
- On some generalizations of the property B problem of an \(n\)-uniform hypergraph
- New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)
This page was built for publication: On one combinatorial problem of Erdös
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q886591)
