Pages that link to "Item:Q5587081"
From MaRDI portal
The following pages link to On A Combinatorial Problem of Erdös (Q5587081):
Displaying 9 items.
- On algorithmic methods of analysis of two-colorings of hypergraphs (Q291223) (← links)
- On the construction of non-2-colorable uniform hypergraphs (Q476325) (← links)
- Sparse colour-critical hypergraphs (Q809089) (← links)
- The enumeration problem for color critical linear hypergraphs (Q1144047) (← links)
- On property B and on Steiner systems (Q1227623) (← links)
- Color-critical graphs and hypergraphs with few edges and no short cycles (Q1379816) (← links)
- On the minimum size of 4-uniform hypergraphs without property \(B\) (Q2434735) (← links)
- Colour-critical graphs and hypergraphs (Q2563172) (← links)
- On the chromatic number of set systems (Q2748418) (← links)
