The following pages link to (Q5724800):
Displayed 12 items.
- Sparse colour-critical hypergraphs (Q809089) (← links)
- On the chromatic number and independence number of hypergraph products (Q858686) (← links)
- Probabilistic methods (Q1091406) (← links)
- On 3-chromatic hypergraphs (Q1137600) (← links)
- On property B(s). II (Q1166541) (← links)
- On property B and on Steiner systems (Q1227623) (← links)
- An extremal problem in hypergraph coloring (Q1235714) (← links)
- Computational experience with approximation algorithms for the set covering problem (Q1278941) (← links)
- From Erdős to algorithms (Q1344623) (← links)
- Bipartite bihypergraphs: a survey and new results (Q2495517) (← links)
- The \(B_r\) property and chromatic numbers of generalized graphs (Q2552143) (← links)
- Arithmetic Progressions and Tic-Tac-Toe Games (Q3530426) (← links)