Intersection theorems for systems of finite sets

DOI10.1007/BF01897141zbMath0134.25101MaRDI QIDQ5344996

No author found.

Publication date: 1964

Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)

zbMATH Keywords

combinatorics

Related Items (only showing first 100 items - show all)

Combinatorics in the exterior algebra and the Bollobás Two Families Theorem ⋮ Compressions and Probably Intersecting Families ⋮ The weighted complete intersection theorem ⋮ Probabilities for Intersecting Systems and Random Subsets of Finite Sets ⋮ Intersection theorems under dimension constraints ⋮ On Sums of Generating Sets in ℤ₂ⁿ ⋮ Colorful Flowers ⋮ Multiply-intersecting families revisited ⋮ Intersecting families of finite sets and fixed-point-free 2-elements ⋮ Anticlusters and intersecting families of subsets ⋮ Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem ⋮ Suboptimal \(s\)-union families and \(s\)-union antichains for vector spaces ⋮ New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\) ⋮ A refined result on cross-intersecting families ⋮ Intersecting families with sunflower shadows ⋮ Applications of graph containers in the Boolean lattice ⋮ Extremal Problem for Matchings and Rainbow Matchings on Direct Products ⋮ Some exact results for multiply intersecting families ⋮ Cross-intersecting non-empty uniform subfamilies of hereditary families ⋮ THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE ⋮ The maximum product of weights of cross-intersecting families ⋮ Vector sum-intersection theorems ⋮ On the sizes of \(t\)-intersecting \(k\)-chain-free families ⋮ Perfect matchings in down-sets ⋮ Improved bounds on the maximum diversity of intersecting families ⋮ A Stability Result for Families with Fixed Diameter ⋮ Shadow ratio of hypergraphs with bounded degree ⋮ Long geodesics in subgraphs of the cube ⋮ A Diametric Theorem in ${\mathbb Z}^n_m$ for Lee and Related Distances ⋮ Families of finite sets satisfying an intersection condition ⋮ Diversity ⋮ Weighted cross-intersecting families ⋮ Unnamed Item ⋮ Erdös–Ko–Rado Theorem—22 Years Later ⋮ Intersecting families, signed sets, and injection ⋮ Generalizations of theorems of Katona and Milner ⋮ Extremal problems among subsets of a set. (Reprint) ⋮ Forbidden Intersections ⋮ On Mubayi's Conjecture and Conditionally Intersecting Sets ⋮ The maximum sum and the maximum product of sizes of cross-intersecting families ⋮ An intersection problem for finite sets ⋮ Hypergraphs Not Containing a Tight Tree with a Bounded Trunk ⋮ Frankl-Rödl-type theorems for codes and permutations ⋮ Continuous versions of some extremal hypergraph problems. II ⋮ Nearly Perfect Matchings in Uniform Hypergraphs ⋮ A cross‐intersection theorem for subsets of a set ⋮ REMARKS ON A QUERY-BASED VARIANT OF THE PARALLEL REPETITION THEOREM ⋮ Specified intersections ⋮ The Edge-Diametric Theorem in Hamming Spaces ⋮ An extension of the Erdős–Ko–Rado Theorem ⋮ Sets of finite sets satisfying union conditions ⋮ The maximum product of sizes of cross-intersecting families ⋮ Intersection problems in the \(q\)-ary cube ⋮ Families of sets with no matchings of sizes 3 and 4 ⋮ Intersecting families in \(\begin{pmatrix}[m\\ \ell\end{pmatrix}\cup\begin{pmatrix}[n]\\ k\end{pmatrix}\)] ⋮ The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities ⋮ Linear independence, a unifying approach to shadow theorems ⋮ An Erdős-Ko-Rado theorem for integer sequences of given rank ⋮ Pairwise intersections and forbidden configurations ⋮ Extremal problems for finite sets and convex hulls---a survey ⋮ Models of multi-user write-efficient memories and general diametric theorems ⋮ Some intersection theorems for ordered sets and graphs ⋮ A stability result for the Katona theorem ⋮ Erdős-Ko-Rado theorem with conditions on the maximal degree ⋮ The maximum sum of sizes of cross-intersecting families of subsets of a set ⋮ A generalization of the Katona theorem for cross t-intersecting families ⋮ A lower bound on the size of a complex generated by an antichain ⋮ On intersecting families of independent sets in trees ⋮ An improved universal bound for \(t\)-intersecting families ⋮ Improved bounds for Erdős' matching conjecture ⋮ Maximal independent sets in the covering graph of the cube ⋮ On Sperner families in which no k sets have an empty intersection ⋮ Cross-intersecting subfamilies of levels of hereditary families ⋮ Best possible bounds concerning the set-wise union of families ⋮ A short proof of an Erdős-Ko-Rado theorem for compositions ⋮ Erdös-Ko-Rado theorems for a family of trees ⋮ A new short proof of the EKR theorem ⋮ Stability for vertex isoperimetry in the cube ⋮ On maximal antichains containing no set and its complement ⋮ Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas ⋮ Extremal problems under dimension constraints. ⋮ Wide-sense 2-frameproof codes ⋮ Intersection theorems for t-valued functions ⋮ An intersection problem for codes ⋮ Shadows and shifting ⋮ On the size of shadow-added intersecting families ⋮ Analogues of Milner's theorem for families without long chains and of vector spaces ⋮ Non \(t\)-intersecting families of linear spaces over \(GF(q)\) ⋮ Multiply-intersecting families ⋮ Union-intersecting set systems ⋮ The edge-diametric theorem in Hamming spaces ⋮ A sharp bound for the product of weights of cross-intersecting families ⋮ New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems ⋮ Diametric theorems in sequence spaces ⋮ Some best possible inequalities concerning cross-intersecting families ⋮ An intersection theorem for systems of finite sets ⋮ Around the complete intersection theorem ⋮ Some intersection theorems ⋮ On cross-intersecting families ⋮ A multiply intersecting Erdős-Ko-Rado theorem -- the principal case

This page was built for publication: Intersection theorems for systems of finite sets