On unavoidable hypergraphs
From MaRDI portal
Publication:5203064
Recommendations
Cited in
(12)- Unavoidable hypergraphs
- The maximum number of edges in a 3-graph not containing a given star
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters
- What must be contained in every oriented k-uniform hypergraph
- Computing maximum unavoidable subgraphs using SAT solvers
- On unavoidable graphs
- Absolutely avoidable order-size pairs in hypergraphs
- Unavoidable stars in 3-graphs
- Universal and unavoidable graphs
- The Algorithmic Aspects of Uncrowded Hypergraphs
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters
- Turán numbers of sunflowers
This page was built for publication: On unavoidable hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5203064)