Set systems with cross \(\mathcal L\)-intersection and \(k\)-wise \(\mathcal L\)-intersecting families
From MaRDI portal
Publication:1045081
DOI10.1016/j.disc.2009.04.014zbMath1183.05012OpenAlexW2051320176MaRDI QIDQ1045081
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.04.014
Erdős-Ko-Rado theoremmultilinear polynomialsFrankl-Wilson theorem\(k\)-wise \(\mathcal L\)-intersecting families
Related Items
Set Systems with L-Intersections and k-Wise L-Intersecting Families ⋮ On the biclique cover of the complete graph ⋮ Non-trivial 3-wise intersecting uniform families ⋮ Set systems with restricted \(k\)-wise \(\mathcal{L}\)-intersections modulo a prime number
Cites Work
- Unnamed Item
- Unnamed Item
- Set systems with \(\mathcal L\)-intersections modulo a prime number
- Intersection theorems with geometric consequences
- Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
- On t-designs
- A generalization of Fisher's inequality
- On generalizations of the deBruijn-Erdős theorem
- Proof of a conjecture of Frankl and Füredi
- Extremal set systems with restricted \(k\)-wise intersections.
- Multiply intersecting families of sets
- On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances
- A sharp bound for the number of sets that pairwise intersect at \(k\) positive values
- Improved bounds on families under \(k\)-wise set-intersection constraints
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On generalized graphs
- A Note on Fisher's Inequality for Balanced Incomplete Block Designs
This page was built for publication: Set systems with cross \(\mathcal L\)-intersection and \(k\)-wise \(\mathcal L\)-intersecting families
