Solution of an extremal problem for sets using resultants of polynomials
From MaRDI portal
Recommendations
Cites work
Cited in
(8)- Exact bounds for some hypergraph saturation problems
- An extremal problem for sets: A new approach via Bezoutians
- Bollobás-type theorems for hemi-bundled two families
- Combinatorics in the exterior algebra and the Bollobás two families theorem
- An extremal problem for sets with applications to graph theory
- Weakly saturated hypergraphs and a conjecture of Tuza
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- Two proofs of Bondy's theorem on induced subsets and two related questions
This page was built for publication: Solution of an extremal problem for sets using resultants of polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809102)