Pages that link to "Item:Q2222935"
From MaRDI portal
The following pages link to On the strong chromatic number of a random 3-uniform hypergraph (Q2222935):
Displaying 11 items.
- Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number (Q1092065) (← links)
- On the \(c\)-strong chromatic number of \(t\)-intersecting hypergraphs (Q1945950) (← links)
- On the maximal cut in a random hypergraph (Q2121837) (← links)
- On the strong chromatic number of random hypergraphs (Q2145753) (← links)
- Estimating the \(r\)-colorability threshold for a random hypergraph (Q2185741) (← links)
- Panchromatic 3-colorings of random hypergraphs (Q2422211) (← links)
- Colorings of partial Steiner systems and their applications (Q2515181) (← links)
- Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs (Q2629488) (← links)
- Estimating the strong \(r\)-colorability threshold in random hypergraphs (Q2694278) (← links)
- On Two Limit Values of the Chromatic Number of a Random Hypergraph (Q5097170) (← links)
- Bounds on threshold probabilities for coloring properties of random hypergraphs (Q6173449) (← links)