SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
From MaRDI portal
Publication:5554997
DOI10.1093/QMATH/18.1.369zbMath0168.26205OpenAlexW3143189643WikidataQ105584034 ScholiaQ105584034MaRDI QIDQ5554997
Anthony J. W. Hilton, Eric C. Milner
Publication date: 1967
Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/qmath/18.1.369
Related Items (only showing first 100 items - show all)
On symmetric intersecting families of vectors ⋮ A Stability Result on Matchings in 3-Uniform Hypergraphs ⋮ Circulant almost cross intersecting families ⋮ Vertex isoperimetry and independent set stability for tensor powers of cliques ⋮ Nontrivial t-Intersecting Families for Vector Spaces ⋮ An algebraic groups perspective on Erdős–Ko–Rado ⋮ Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs ⋮ On the Holroyd-Talbot conjecture for sparse graphs ⋮ Turán and Ramsey numbers for 3‐uniform minimal paths of length 4 ⋮ The unique coclique extension property for apartments of buildings ⋮ A refined result on cross-intersecting families ⋮ The Profile Polytope of Nontrivial Intersecting Families ⋮ Triangles in intersecting families ⋮ Sharp threshold for the Erdős–Ko–Rado theorem ⋮ Renitent lines ⋮ Some inequalities concerning cross-intersecting families of integer sequences ⋮ Stability of intersecting families ⋮ Non-empty cross-3-intersection theorems of subsets ⋮ A \(t\)-intersecting Hilton-Milner theorem for vector spaces ⋮ r$r$‐Cross t$t$‐intersecting families via necessary intersection points ⋮ The maximum measure of non-trivial 3-wise intersecting families ⋮ The \(q\)-analogue of zero forcing for certain families of graphs ⋮ On finding constrained independent sets in cycles ⋮ A product version of the Hilton-Milner theorem ⋮ Intersecting families of sets are typically trivial ⋮ A product version of the Hilton-Milner-Frankl theorem ⋮ Fixed-Parameter Algorithms for the Kneser and Schrijver Problems ⋮ Non-trivial \(r\)-wise intersecting families ⋮ The realization of distances within sets in Euclidean space ⋮ A Kruskal-Katona-type theorem for graphs: \(q\)-Kneser graphs ⋮ Extremal problems in hypergraph colourings ⋮ Uniform intersecting families with large covering number ⋮ Triangles in \(r\)-wise \(t\)-intersecting families ⋮ Vector sum-intersection theorems ⋮ The structure of maximal non-trivial \(d\)-wise intersecting uniform families with large sizes ⋮ A proof of Frankl's conjecture on cross-union families ⋮ Non-trivial \(t\)-intersecting separated families ⋮ A note on the maximum product-size of non-trivial cross \(t\)-intersecting families ⋮ Trivial colors in colorings of Kneser graphs ⋮ Improved bounds on the maximum diversity of intersecting families ⋮ A Stability Result for Families with Fixed Diameter ⋮ Uniform s-Cross-Intersecting Families ⋮ A generalization of Kneser's conjecture ⋮ A new generalization of the Erdős-Ko-Rado theorem ⋮ Short proofs of three results about intersecting systems ⋮ A note on non-empty cross-intersecting families ⋮ A generalization of diversity for intersecting families ⋮ Intersecting families with covering number three ⋮ Intersecting families of permutations ⋮ On intersecting families of finite sets ⋮ On intersecting families of finite sets ⋮ Intersecting families, signed sets, and injection ⋮ Extremal Peisert-type graphs without the strict-EKR property ⋮ Non-empty pairwise cross-intersecting families ⋮ Large non-trivial \(t\)-intersecting families of signed sets ⋮ Nearly extremal non-trivial cross \(t\)-intersecting families and \(r\)-wise \(t\)-intersecting families ⋮ On \(k\)-wise \(L\)-intersecting families for simplicial complexes ⋮ Some results around the Erdős matching conjecture ⋮ The maximum sum of sizes of non-empty cross \(t\)-intersecting families ⋮ Intersecting families without unique shadow ⋮ Stabilities for non-uniform \(t\)-intersecting families ⋮ On non-empty cross-\(t\)-intersecting families ⋮ All \(3\)-transitive groups satisfy the strict-Erdős-Ko-Rado property ⋮ On non-degenerate Turán problems for expansions ⋮ Intersecting families of polynomials over finite fields ⋮ Interview with Douglas West ⋮ Sharp bounds for the chromatic number of random Kneser graphs ⋮ Grundy domination and zero forcing in Kneser graphs ⋮ On Erdős–Ko–Rado for Random Hypergraphs II ⋮ On Erdős–Ko–Rado for random hypergraphs I ⋮ Matching criticality in intersecting hypergraphs ⋮ A cross‐intersection theorem for subsets of a set ⋮ Boolean functions: influence, threshold and noise ⋮ Covering by intersecting families ⋮ Turán numbers for 3-uniform linear paths of length 3 ⋮ The order dimension of two levels of the Boolean lattices ⋮ EKR sets for large \(n\) and \(r\) ⋮ Domination in intersecting hypergraphs ⋮ The Hilton-Milner theorem for finite affine spaces ⋮ Two extremal problems on intersecting families ⋮ On the representing number of intersecting families ⋮ Uniform intersecting families with covering number four ⋮ Short proofs of the Kneser-Lovász coloring principle ⋮ A simple removal lemma for large nearly-intersecting families ⋮ Pairwise intersections and forbidden configurations ⋮ Finite projective spaces and intersecting hypergraphs ⋮ A stability result for the Katona theorem ⋮ Erdős-Ko-Rado theorem with conditions on the maximal degree ⋮ The complexity of multicolouring ⋮ Diversity of uniform intersecting families ⋮ Non-trivial intersecting uniform sub-families of hereditary families ⋮ Improved bounds for Erdős' matching conjecture ⋮ A Hilton-Milner-type theorem and an intersection conjecture for signed sets ⋮ Large \(\{0,1,\ldots,t\}\)-cliques in dual polar graphs ⋮ Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set ⋮ On the stability of the Erdős-Ko-Rado theorem ⋮ A short proof of an Erdős-Ko-Rado theorem for compositions ⋮ Regular bipartite graphs and intersecting families ⋮ A degree version of the Hilton-Milner theorem ⋮ Families with no matchings of size \(s\)
This page was built for publication: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
