Combinatorics in the exterior algebra and the Bollobás Two Families Theorem
From MaRDI portal
Publication:5034136
DOI10.1112/jlms.12484zbMath1483.05193arXiv1907.06019OpenAlexW3181654275MaRDI QIDQ5034136
Elizabeth L. Wilmer, Alexander D. Scott
Publication date: 24 February 2022
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.06019
Extremal set theory (05D05) Exterior algebra, Grassmann algebras (15A75) Configurations and arrangements of linear subspaces (14N20)
Related Items
Weakly saturated hypergraphs and a conjecture of Tuza, On the Power of Choice for Boolean Functions, An algebraic groups perspective on Erdős–Ko–Rado, Problems and results on 1-cross-intersecting set pair systems, Erdős-Ko-Rado and Hilton-Milner theorems for two-forms, Bollobás-type theorems for hemi-bundled two families
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Katona's intersection theorem: four proofs
- A Sperner theorem on unrelated chains of subsets
- The complete intersection theorem for systems of finite sets
- Intersection patterns of convex sets
- Geometrical solution of an intersection problem for two hypergraphs
- Solution of an extremal problem for sets using resultants of polynomials
- The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
- Properties of intersecting families of ordered sets
- Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). I: Necessity of Eckhoff's conditions
- An extremal problem for sets with applications to graph theory
- A simple proof of the upper bound theorem
- Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). II: Sufficiency of Eckhoff's conditions
- Hyperconnectivity of graphs
- Inequalities for two set systems with prescribed intersections
- An extremal problem for two families of sets
- Gotzmann theorems for exterior algebras and combinatorics
- On the Erdős-Ko-Rado theorem and the Bollobás theorem for \(t\)-intersecting families
- A remark on the paper ``Properties of intersecting families of ordered sets by O. Einstein
- Matchings and covers in hypergraphs
- Solution of a problem of A. Ehrenfeucht and J. Mycielski
- A new Bollobás-type inequality and applications to \(t\)-intersecting families of sets
- Bollobás-type theorems for hemi-bundled two families
- Set systems related to a house allocation problem
- Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
- Logarithmic order of free distributive lattice
- Weakly Saturated Hypergraphs and Exterior Algebra
- On Families of Weakly Cross-intersecting Set-pairs
- Extremal Combinatorics
- Extremal Finite Set Theory
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Erdős–Ko–Rado Theorems: Algebraic Approaches
- Extremal Problems for Finite Sets
- Monomial Ideals
- Intersection theorems for systems of finite sets
- On generalized graphs
- A short proof of Sperner's lemma
- Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
- A new generalization of the Erdős-Ko-Rado theorem
- An algebraic groups perspective on Erdős–Ko–Rado
