scientific article; zbMATH DE number 3621717
From MaRDI portal
zbMath0401.05001MaRDI QIDQ4184835
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A product version of the Hilton-Milner-Frankl theorem, Non-trivial \(r\)-wise intersecting families, Triangles in \(r\)-wise \(t\)-intersecting families, Vector sum-intersection theorems, Intersection theorems for \((- 1, 0, 1)\)-vectors, Non-trivial \(t\)-intersecting separated families, A note on the maximum product-size of non-trivial cross \(t\)-intersecting families, A proof of Frankl–Kupavskii's conjecture on edge‐union condition, Improved bounds on the maximum diversity of intersecting families, Erd\H os-Ko-Rado type theorems for simplicial complexes via algebraic shifting, The maximum product of sizes of cross-intersecting families, Intersection problems in the \(q\)-ary cube, The weighted complete intersection theorem, Probabilities for Intersecting Systems and Random Subsets of Finite Sets, The Erdős-Ko-Rado theorem for vector spaces, The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities, Linear independence, a unifying approach to shadow theorems, On the Erdős-Ko-Rado theorem and the Bollobás theorem for \(t\)-intersecting families, An Erdős-Ko-Rado theorem for integer sequences of given rank, Multiply-intersecting families revisited, Extremal problems for finite sets and convex hulls---a survey, The maximum size of 3-wise \(t\)-intersecting families, A common generalization to theorems on set systems with \(\mathcal L\)-intersections, An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms, Exact solution of some Turán-type problems, Bounding one-way differences, The maximum sum of sizes of cross-intersecting families of subsets of a set, Extremal \(t\)-intersecting families for direct products, The eigenvalue method for cross \(t\)-intersecting families, EKR type inequalities for 4-wise intersecting families, An improved universal bound for \(t\)-intersecting families, Non-trivial \(t\)-intersecting families for symplectic polar spaces, An analogue of the Erdős-Ko-Rado theorem for weak compositions, Nontrivial t-Intersecting Families for Vector Spaces, On the maximum number of edges in hypergraphs with fixed matching and clique number, Cross-intersecting subfamilies of levels of hereditary families, Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set, A short proof of an Erdős-Ko-Rado theorem for compositions, Cross-intersecting families and primitivity of symmetric systems, A refined result on cross-intersecting families, A simple proof of the Hilton-Milner theorem, An Erdős-Ko-Rado theorem for permutations with fixed number of cycles, Regular bipartite graphs and intersecting families, A degree version of the Hilton-Milner theorem, Some inequalities concerning cross-intersecting families of integer sequences, Cross-intersecting non-empty uniform subfamilies of hereditary families, r$r$‐Cross t$t$‐intersecting families via necessary intersection points, Integer sequences without singleton intersection, A non-trivial intersection theorem for permutations with fixed number of cycles, A product version of the Hilton-Milner theorem, A new short proof of the EKR theorem, Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas, Intersections and distinct intersections in cross-intersecting families, On cross \(t\)-intersecting families of sets, The Erdős-Ko-Rado theorem for singular linear spaces, Intersection theorems for t-valued functions, An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families, An intersection problem for codes, An extension of the Erdoes, Ko, Rado theorem to t-designs, Beyond the Erdős-Ko-Rado theorem, On the size of shadow-added intersecting families, Analogues of Milner's theorem for families without long chains and of vector spaces, Erdős-Ko-Rado theorems for permutations and set partitions, Multiply-intersecting families, Union-intersecting set systems, A note on supersaturated set systems, The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture, Intersecting faces of a simplicial complex via algebraic shifting, Diversity, A sharp bound for the product of weights of cross-intersecting families, On the maximum number of edges in a hypergraph with given matching number, Around the complete intersection theorem, Towards extending the Ahlswede-Khachatrian theorem to cross \(t\)-intersecting families, A multiply intersecting Erdős-Ko-Rado theorem -- the principal case, A product version of the Erdős-Ko-Rado theorem, Some Erdős-Ko-Rado theorems for injections, The Hilton-Milner theorem for attenuated spaces, Intersecting families of discrete structures are typically trivial, Set systems with positive intersection sizes, Erdös–Ko–Rado Theorem—22 Years Later, Forbidden Intersections, Erdős-Ko-Rado theorems on the weak Bruhat lattice, An exact result for \((0, \pm 1)\)-vectors, Beyond the Erdős matching conjecture, Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems, Simple juntas for shifted families, Invitation to intersection problems for finite sets, Strongly intersecting integer partitions, The structure of large non-trivial \(t\)-intersecting families of finite sets, Erdős-Ko-Rado theorems for set partitions with certain block size, The EKR property for flag pure simplicial complexes without boundary, On strengthenings of the intersecting shadow theorem, The diametric theorem in Hamming spaces---optimal anticodes, Families of finite sets satisfying intersection restrictions, Nonhomogeneous analytic families of trees, On \(t\)-intersecting families of signed sets and permutations, AK-type stability theorems on cross \(t\)-intersecting families, Maximum degree and diversity in intersecting hypergraphs, Unnamed Item, A cross‐intersection theorem for subsets of a set, The Erdös-Ko-Rado Theorem for Integer Sequences, Partially Symmetric Functions Are Efficiently Isomorphism Testable, On \(r\)-cross \(t\)-intersecting families for weak compositions, Extremal problems concerning Kneser-graphs, A Deza-Frankl type theorem for set partitions, The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem, Non-trivial intersecting families, On the bandwidth of the Kneser graph
