Pages that link to "Item:Q5890912"
From MaRDI portal
The following pages link to Colorings of hypergraphs with large number of colors (Q5890912):
Displaying 12 items.
- Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number (Q268128) (← links)
- Van der Waerden function and colorings of hypergraphs with large girth (Q382207) (← links)
- Lower bounds for the number of edges in hypergraphs of certain classes (Q630232) (← links)
- On two-colorings of hypergraphs (Q656242) (← links)
- Improvement of the lower bound in the Erdös-Hajnal combinatorial problem (Q736013) (← links)
- Around Erdős-Lovász problem on colorings of non-uniform hypergraphs (Q2352063) (← links)
- On the chromatic number of set systems (Q2748418) (← links)
- Kneser colorings of uniform hypergraphs (Q2851466) (← links)
- Random coloring method in the combinatorial problem of Erdős and Lovász (Q3119050) (← links)
- Coloring uniform hypergraphs with few colors (Q4446874) (← links)
- Essentially infinite colourings of hypergraphs (Q5427831) (← links)
- Colorings of hypergraphs with large number of colors (Q5895162) (← links)