Extremal Finite Set Theory
From MaRDI portal
Publication:3130455
DOI10.1201/9780429440809zbMath1409.05002OpenAlexW2909784596MaRDI QIDQ3130455
Publication date: 22 January 2018
Full work available at URL: https://doi.org/10.1201/9780429440809
Erdős-Ko-Rado theoremKruskal-Katona theoremTurán-type problemsintersection familySperner's theoremforbidden subposet problemsextremal finite set theorycombinatorial search theoryforbidden hypergraph
Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorics of partially ordered sets (06A07) Extremal set theory (05D05)
Related Items (17)
Combinatorics in the exterior algebra and the Bollobás Two Families Theorem ⋮ Singular Turán numbers and worm-colorings ⋮ On Generalized Turán Results in Height Two Posets ⋮ Discrepancies of spanning trees and Hamilton cycles ⋮ Erdős-Ko-Rado theorem for a restricted universe ⋮ The Profile Polytope of Nontrivial Intersecting Families ⋮ The covering lemma and q-analogues of extremal set theory problems ⋮ $t$-Wise Berge and $t$-Heavy Hypergraphs ⋮ Analogues of Milner's theorem for families without long chains and of vector spaces ⋮ Linear Turán numbers of acyclic triple systems ⋮ Intersecting families, signed sets, and injection ⋮ On the arithmetic mean of the size of cross-union families ⋮ On \(L\)-close Sperner systems ⋮ Turán problems for Berge-\((k, p)\)-fan hypergraph ⋮ Hypergraph based Berge hypergraphs ⋮ Forbidden subposet problems in the grid ⋮ Generalized forbidden subposet problems
This page was built for publication: Extremal Finite Set Theory
