Pages that link to "Item:Q3119050"
From MaRDI portal
The following pages link to Random coloring method in the combinatorial problem of Erdős and Lovász (Q3119050):
Displaying 7 items.
- Improved algorithms for colorings of simple hypergraphs and applications (Q896005) (← links)
- Coloring hypergraphs with bounded cardinalities of edge intersections (Q2297713) (← links)
- A generalization of the Hajnal-Szemerédi theorem for uniform hypergraphs (Q2353014) (← links)
- Colorings of partial Steiner systems and their applications (Q2515181) (← links)
- Multipass greedy coloring of simple uniform hypergraphs (Q3467582) (← links)
- Colourings of Uniform Hypergraphs with Large Girth and Applications (Q4643316) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
