The following pages link to On unavoidable hypergraphs (Q5203064):
Displaying 10 items.
- On unavoidable graphs (Q595677) (← links)
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters (Q640838) (← links)
- Unavoidable stars in 3-graphs (Q793053) (← links)
- What must be contained in every oriented k-uniform hypergraph (Q1092925) (← links)
- The maximum number of edges in a 3-graph not containing a given star (Q1095933) (← links)
- Unavoidable hypergraphs (Q1984522) (← links)
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters (Q2851439) (← links)
- The Algorithmic Aspects of Uncrowded Hypergraphs (Q4268877) (← links)
- Turán numbers of sunflowers (Q5060342) (← links)
- Universal and unavoidable graphs (Q5886120) (← links)