Pages that link to "Item:Q886591"
From MaRDI portal
The following pages link to On one combinatorial problem of Erdös (Q886591):
Displaying 6 items.
- On balanced colorings of hypergraphs (Q548768) (← links)
- Upper bound in the Erdős-Hajnal problem of hypergraph coloring (Q1947784) (← links)
- New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\) (Q2088728) (← links)
- 2-colorings of hypergraphs with large girth (Q2197249) (← links)
- On some generalizations of the property B problem of an \(n\)-uniform hypergraph (Q2671957) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)