Intersection theorems for systems of finite sets
From MaRDI portal
Publication:5344996
DOI10.1007/BF01897141zbMath0134.25101MaRDI QIDQ5344996
Publication date: 1964
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Related Items
Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem, On hypergraphs without two edges intersecting in a given number of vertices, Linear dependencies among subsets of a finite set, Pairwise intersections and forbidden configurations, Intersection theorems for t-valued functions, An intersection problem for codes, The edge-diametric theorem in Hamming spaces, Extremal problems concerning Kneser-graphs, Forbidding just one intersection, Extremal hypergraph problems and convex hulls, An Erdős-Ko-Rado theorem for integer sequences of given rank, Some intersection theorems for ordered sets and graphs, Erdős-Ko-Rado theorem with conditions on the maximal degree, 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 Sperner families in which no k sets have an empty intersection, On maximal antichains containing no set and its complement, Shadows and shifting, Non \(t\)-intersecting families of linear spaces over \(GF(q)\), Multiply-intersecting families, Diametric theorems in sequence spaces, Some best possible inequalities concerning cross-intersecting families, Some intersection theorems, On cross-intersecting families, n-tuple colorings and associated graphs, The proof of a conjecture of G. O. H. Katona, Intersection theorems for systems of finite vector spaces, Intersection theorems and a lemma of Kleitman, On the maximum number of permutations with given maximal or minimal distance, Contributions to the geometry of Hamming spaces, Families of finite sets satisfying a union condition, A Sperner-type theorem for families of finite sets, On systems of finite sets with constraints on their unions and intersections, On a conjecture on the Sperner property, A simple proof of a theorem of Milner, The diametric theorem in Hamming spaces---optimal anticodes, Weight functions on the Kneser graph and the solution of an intersection problem of Sali, Extremal problems for finite sets and convex hulls---a survey, Models of multi-user write-efficient memories and general diametric theorems, Extremal problems under dimension constraints., Erdős-Ko-Rado with conditions on the minimum complementary degree, Random walks and multiply intersecting families, Multiply intersecting families of sets, On families of finite sets with bounds on unions and intersections, Extremal problems among subsets of a set, The \(t\)-intersection problem in the truncated Boolean lattice, Weighted 3-wise 2-intersecting families, Intersection theorems under dimension constraints, Multiply-intersecting families revisited, Weighted cross-intersecting families, Extremal problems among subsets of a set. (Reprint), Intersecting families of finite sets and fixed-point-free 2-elements, Anticlusters and intersecting families of subsets, Erdös–Ko–Rado Theorem—22 Years Later, The Edge-Diametric Theorem in Hamming Spaces, An extension of the Erdős–Ko–Rado Theorem, A Diametric Theorem in ${\mathbb Z}^n_m$ for Lee and Related Distances, Probabilities for Intersecting Systems and Random Subsets of Finite Sets, Forbidden Intersections, Continuous versions of some extremal hypergraph problems. II, Sets of finite sets satisfying union conditions, Families of finite sets satisfying an intersection condition, Generalizations of theorems of Katona and Milner, An intersection problem for finite sets
