Pages that link to "Item:Q1092065"
From MaRDI portal
The following pages link to Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number (Q1092065):
Displaying 9 items.
- On the strong chromatic number of random hypergraphs (Q2145753) (← links)
- General independence sets in random strongly sparse hypergraphs (Q2190919) (← links)
- On the strong chromatic number of a random 3-uniform hypergraph (Q2222935) (← links)
- On the weak chromatic number of random hypergraphs (Q2309562) (← links)
- On the \(s\)-colorful number of a random hypergraph (Q2662926) (← links)
- On the concentration of the independence numbers of random hypergraphs (Q2688835) (← links)
- Estimating the strong \(r\)-colorability threshold in random hypergraphs (Q2694278) (← links)
- On the concentration of values of \(j\)-chromatic numbers of random hypergraphs (Q6112960) (← links)
- Bounds on threshold probabilities for coloring properties of random hypergraphs (Q6173449) (← links)
