Pages that link to "Item:Q3599156"
From MaRDI portal
The following pages link to Approximating Independent Set and Coloring in Random Uniform Hypergraphs (Q3599156):
Displaying 6 items.
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Universal limit theorems in graph coloring problems with connections to extremal combinatorics (Q525299) (← links)
- Coupling with the stationary distribution and improved sampling for colorings and independent sets (Q862206) (← links)
- Random maximal independent sets and the unfriendly theater seating arrangement problem (Q1044988) (← links)
- Non-independent randomized rounding and coloring (Q2489958) (← links)
- Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set (Q4972690) (← links)