Pages that link to "Item:Q5002721"
From MaRDI portal
The following pages link to A note on two-colorability of nonuniform hypergraphs (Q5002721):
Displaying 10 items.
- Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs (Q1637144) (← links)
- Some properties of non-bicolorable hypergraphs and the four-color problem (Q1917261) (← links)
- New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\) (Q2088728) (← links)
- Random hypergraphs and property B (Q2225409) (← links)
- Greedy colorings of uniform hypergraphs (Q3055773) (← links)
- How many random edges make a dense hypergraph non-2-colorable? (Q3503605) (← links)
- Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma (Q4521547) (← links)
- Two‐coloring random hypergraphs (Q4543631) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- Streaming Algorithms for 2-Coloring Uniform Hypergraphs (Q5199282) (← links)