Pages that link to "Item:Q5339311"
From MaRDI portal
The following pages link to On a Combinatorial Problem of Erdös and Hajnal (Q5339311):
Displaying 11 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)
- On property B(s). II (Q1166541) (← links)
- On-line algorithms for 2-coloring hypergraphs via chip games (Q1210300) (← links)
- On packing time-respecting arborescences (Q2172082) (← links)
- The \(B_r\) property and chromatic numbers of generalized graphs (Q2552143) (← links)
- Improved Bounds for Uniform Hypergraphs without Property B (Q5109054) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- The intersection spectrum of 3‐chromatic intersecting hypergraphs (Q6051524) (← links)
- The intersection spectrum of 3-chromatic intersecting hypergraphs (Q6604685) (← links)