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 ⋮ Intersecting families of permutations ⋮ On intersecting families of finite sets ⋮ On intersecting families of finite sets ⋮ Intersecting families, signed sets, and injection ⋮ 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 ⋮ Maximal sets of \(k\)-spaces pairwise intersecting in at least a \((k-2)\)-space ⋮ The maximum product of sizes of cross-intersecting families ⋮ Most Probably Intersecting Families of Subsets ⋮ Stability on matchings in 3-uniform hypergraphs ⋮ Transversals and independence in linear hypergraphs with maximum degree two ⋮ Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three ⋮ A bipartite Erdős-Ko-Rado theorem ⋮ Intersection theorems under dimension constraints ⋮ Circular colouring and algebraic no-homomorphism theorems ⋮ TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM ⋮ The Distortion of Locality Sensitive Hashing ⋮ Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three ⋮ Intersecting \(k\)-uniform families containing a given family ⋮ Size and structure of large \((s,t)\)-union intersecting families ⋮ Clique number of Xor products of Kneser graphs ⋮ An intersection theorem for four sets ⋮ Multiply-intersecting families revisited ⋮ Cross-intersecting families of finite sets ⋮ On the Erdős–Ginzburg–Ziv invariant and zero-sum Ramsey number for intersecting families ⋮ Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture ⋮ The maximum sum of sizes of cross-intersecting families of subsets of a set ⋮ Sharp bounds for the chromatic number of random Kneser graphs ⋮ On intersecting families of independent sets in trees ⋮ Almost intersecting families ⋮ Non-trivial \(t\)-intersecting families for symplectic polar spaces ⋮ The spectral radii of intersecting uniform hypergraphs ⋮ Stability results for vertex Turán problems in Kneser graphs ⋮ Erdős-Ko-Rado theorem for a restricted universe ⋮ On the maximum number of edges in hypergraphs with fixed matching and clique number ⋮ Cross-intersecting subfamilies of levels of hereditary families ⋮ A simple proof of the Hilton-Milner theorem ⋮ Structure and supersaturation for intersecting families ⋮ Cross-intersecting non-empty uniform subfamilies of hereditary families ⋮ The maximum product of weights of cross-intersecting families ⋮ Hilton-Milner results in projective and affine spaces ⋮ Counting Intersecting and Pairs of Cross-Intersecting Families ⋮ On eigenfunctions and maximal cliques of generalised Paley graphs of square order ⋮ Non-trivial 3-wise intersecting uniform families ⋮ Erdős-Ko-Rado theorems for simplicial complexes ⋮ Characterizing maximal shifted intersecting set systems and short injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems ⋮ The structure of large intersecting families ⋮ Erdős-Ko-Rado and Hilton-Milner theorems for two-forms ⋮ Theorems of Erdős-Ko-Rado type in geometrical settings ⋮ Intersections and distinct intersections in cross-intersecting families ⋮ Linear hypergraphs with large transversal number and maximum degree two ⋮ Circular chromatic number of induced subgraphs of Kneser graphs ⋮ On the number of distinct differences in an intersecting family
This page was built for publication: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
