Pages that link to "Item:Q5451060"
From MaRDI portal
The following pages link to Extremal problems for colourings of uniform hypergraphs (Q5451060):
Displayed 9 items.
- On algorithmic methods of analysis of two-colorings of hypergraphs (Q291223) (← links)
- 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)
- Random constructions of hypergraphs with large girth and without panchromatic colorings (Q2671969) (← links)
- On a generalization of Rubin's theorem (Q3018075) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)