Pages that link to "Item:Q1947784"
From MaRDI portal
The following pages link to Upper bound in the Erdős-Hajnal problem of hypergraph coloring (Q1947784):
Displayed 5 items.
- On algorithmic methods of analysis of two-colorings of hypergraphs (Q291223) (← 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 small \(n\)-uniform hypergraphs with positive discrepancy (Q2338645) (← links)
- On some generalizations of the property B problem of an \(n\)-uniform hypergraph (Q2671957) (← links)