The following pages link to Coloring and the Lovász local lemma (Q847296):
Displaying 8 items.
- Acyclic edge coloring through the Lovász local lemma (Q507595) (← links)
- Hypergraph colouring and the Lovász local lemma (Q1356486) (← links)
- Polychromatic colorings and cover decompositions of hypergraphs (Q2007510) (← links)
- Polychromatic colorings of hypergraphs with high balance (Q2129929) (← links)
- Measurable versions of the Lovász local lemma and measurable graph colorings (Q2319876) (← links)
- 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs (Q2509706) (← links)
- A note on near-optimal coloring of shift hypergraphs (Q3467579) (← links)
- Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma (Q4521547) (← links)