Solution of an extremal problem for sets using resultants of polynomials
From MaRDI portal
Publication:809102
DOI10.1007/BF02128673zbMATH Open0732.05054OpenAlexW2091757636MaRDI QIDQ809102FDOQ809102
Publication date: 1990
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02128673
Recommendations
[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=theorem+of+Bollob%EF%BF%BD%EF%BF%BDs&go=Go theorem of Bollob��s]
Cites Work
Cited In (7)
- Exact bounds for some hypergraph saturation problems
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- An extremal problem for sets with applications to graph theory
- Bollobás-type theorems for hemi-bundled two families
- An extremal problem for sets: A new approach via Bezoutians
- Combinatorics in the exterior algebra and the Bollobás Two Families Theorem
- Weakly saturated hypergraphs and a conjecture of Tuza
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)