Pages that link to "Item:Q1241757"
From MaRDI portal
The following pages link to On a combinatorial problem of P. Erdős and L. Lovasz (Q1241757):
Displaying 8 items.
- Improvement of the lower bound in the Erdös-Hajnal combinatorial problem (Q736013) (← links)
- Coloring non-uniform hypergraphs without short cycles (Q742641) (← links)
- On 3-chromatic hypergraphs (Q1137600) (← links)
- On proper colorings of hypergraphs (Q1930218) (← links)
- On proper colourings of hypergraphs using prescribed colours (Q3057818) (← 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)
