Pages that link to "Item:Q322292"
From MaRDI portal
The following pages link to Extremal problems for colorings of simple hypergraphs and applications (Q322292):
Displaying 8 items.
- On algorithmic methods of analysis of two-colorings of hypergraphs (Q291223) (← links)
- Improved algorithms for colorings of simple hypergraphs and applications (Q896005) (← links)
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs (Q1818218) (← links)
- Colorings of partial Steiner systems and their applications (Q2515181) (← links)
- Multipass greedy coloring of simple uniform hypergraphs (Q3467582) (← links)
- On Some Extremal Properties of Hypergraph Colorings (Q3503457) (← links)
- (Q4347903) (← links)
- Extremal <i>H</i>‐Colorings of Graphs with Fixed Minimum Degree (Q5251205) (← links)