scientific article
From MaRDI portal
Publication:3770569
zbMath0633.05038MaRDI QIDQ3770569
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erdős-Ko-Rado theoremextremal set theorysurvey paperHilton-Milner theoremKruskal-Katona theoremintersecting familiesshiftingBrace-Daykin theorem
Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Hypergraphs (05C65)
Related Items
The maximum product of sizes of cross-intersecting families, Intersection problems in the \(q\)-ary cube, A bipartite Erdős-Ko-Rado theorem, Intersecting families in \(\begin{pmatrix}[m\\ \ell\end{pmatrix}\cup\begin{pmatrix}[n]\\ k\end{pmatrix}\)], EKR sets for large \(n\) and \(r\), Union of shadows, Intersecting \(k\)-uniform families containing a given family, Two extremal problems on intersecting families, Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension, A note on a conjecture of bene Watts-Norin-Yepremyan for Lagrangian, Cross-intersecting families of finite sets, The number of faces of balanced Cohen-Macaulay complexes and a generalized Macaulay theorem, Maximizing \(2\)-independents sets in \(3\)-uniform hypergraphs, Proof of a conjecture of Frankl and Füredi, The maximum sum of sizes of cross-intersecting families of subsets of a set, On the sum of sizes of overlapping families, The Erdős matching conjecture and concentration inequalities, Zero-sum problems -- a survey, EKR type inequalities for 4-wise intersecting families, On Chvàtal's conjecture and a conjecture on families of signed sets, An improved universal bound for \(t\)-intersecting families, Non-trivial intersecting uniform sub-families of hereditary families, A Hilton-Milner-type theorem and an intersection conjecture for signed sets, Two-regular subgraphs of odd-uniform hypergraphs, Erdős-Ko-Rado theorem for a restricted universe, Cross-intersecting subfamilies of levels of hereditary families, Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set, Proof of the Erdős matching conjecture in a new range, A short proof of an Erdős-Ko-Rado theorem for compositions, How many colors guarantee a rainbow matching?, Regular bipartite graphs and intersecting families, Some exact results for multiply intersecting families, Turán, involution and shifting, Cross-intersecting non-empty uniform subfamilies of hereditary families, On \(q\)-analogues and stability theorems, More about shifting techniques, Some good characterization results relating to the Kőnig-Egerváry theorem, Triangle-intersecting families of graphs, Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels, On the \(c\)-strong chromatic number of \(t\)-intersecting hypergraphs, Erdős-Ko-Rado theorems for simplicial complexes, Non-trivially intersecting multi-part families, The maximum number of cliques in hypergraphs without large matchings, Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees, Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas, On cross \(t\)-intersecting families of sets, A structure theorem for almost low-degree functions on the slice, The maximum size of intersecting and union families of sets, Shadows and shifting, Maximum hitting of a set by compressed intersecting families, On the size of shadow-added intersecting families, Geometric influences. II: Correlation inequalities and noise sensitivity, Multiply-intersecting families, 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, Constrained versions of Sauer's Lemma, On families of sets without \(k\) pairwise disjoint members, Cross-intersecting pairs of hypergraphs, A structural result for 3-graphs, On the maximum number of edges in a hypergraph with given matching number, A generalization of Erdős' matching conjecture, A product version of the Erdős-Ko-Rado theorem, Cross-intersecting families of permutations, Multiple cross-intersecting families of signed sets, Random walks and multiply intersecting families, On non-trivial families without a perfect matching, On the structure of minimal winning coalitions in simple voting games, Beyond the Erdős matching conjecture, Old and new applications of Katona's circle, Minimum degree and diversity in intersecting antichains, On the \(d\)-cluster generalization of Erdős-Ko-Rado, Invitation to intersection problems for finite sets, On the arithmetic mean of the size of cross-union families, The influence of variables in product spaces, Strongly intersecting integer partitions, Maximum hitting for \(n\) sufficiently large, Tight bounds for Katona's shadow intersection theorem, On strengthenings of the intersecting shadow theorem, Classification of maximum hittings by large families, Matchings and covers in hypergraphs, A Kruskal-Katona type result and applications, Families of finite sets satisfying intersection restrictions, On \(t\)-intersecting families of signed sets and permutations, Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman, A short proof of Talbot's theorem for intersecting separated sets, VC dimension and a union theorem for set systems, A generalization of Fisher's inequality, Cross-intersecting sub-families of hereditary families, AK-type stability theorems on cross \(t\)-intersecting families, Maximum degree and diversity in intersecting hypergraphs, The Erdős-Ko-Rado properties of various graphs containing singletons, The Erdős-Ko-Rado properties of set systems defined by double partitions, On the size of the product of overlapping families, Turán problems for vertex-disjoint cliques in multi-partite hypergraphs, On the rainbow matching conjecture for 3-uniform hypergraphs, A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets, The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem, Transversal numbers for hypergraphs arising in geometry, Weighted 3-wise 2-intersecting families, The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families, Rainbow version of the Erdős Matching Conjecture via concentration, Families with no perfect matchings, Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture, Analogues of Katona's and Milner's theorems for two families, On the maximum number of edges in hypergraphs with fixed matching and clique number, An algebraic groups perspective on Erdős–Ko–Rado, A refined result on cross-intersecting families, Extremal Problem for Matchings and Rainbow Matchings on Direct Products, On families with bounded matching number, Some inequalities concerning cross-intersecting families of integer sequences, Stability of intersecting families, Spectral radius and rainbow matchings of graphs, Intersecting families of graphs of functions over a finite field, Integer sequences without singleton intersection, The maximum measure of non-trivial 3-wise intersecting families, A product version of the Hilton-Milner theorem, Erdős matching conjecture for almost perfect matchings, Non-trivial \(r\)-wise intersecting families, Uniform intersecting families with large covering number, The structure of maximal non-trivial \(d\)-wise intersecting uniform families with large sizes, Families with restricted matching number and multiply covered shadows, A proof of Frankl's conjecture on cross-union families, Non-trivial \(t\)-intersecting separated families, Non-trivial 3-wise intersecting uniform families, A proof of Frankl–Kupavskii's conjecture on edge‐union condition, Improved bounds on the maximum diversity of intersecting families, Max-norm Ramsey theory, A Rainbow r-Partite Version of the Erdős–Ko–Rado Theorem, Hypergraph Turán numbers of linear cycles, Constructions of binary codes with two distances, Intersections and distinct intersections in cross-intersecting families, The maximum measure of 3-wise \(t\)-intersecting families, On Erdős' extremal problem on matchings in hypergraphs, Diversity, Isoperimetry in integer lattices, On the complexity of constrained VC-classes, Unnamed Item, On Mubayi's Conjecture and Conditionally Intersecting Sets, Spaces of \(p\)-vectors of bounded rank, The maximum sum and the maximum product of sizes of cross-intersecting families, Simple juntas for shifted families, The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family, A cross‐intersection theorem for subsets of a set
