Intersection Properties of Systems of Finite Sets

DOI10.1112/plms/s3-36.2.369zbMath0407.05006OpenAlexW2091239462WikidataQ101132365 ScholiaQ101132365MaRDI QIDQ4193465

Peter Frankl, Michel Marie Deza

Publication date: 1978

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/plms/s3-36.2.369

zbMATH Keywords

intersection propertiessystems of finite sets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (47)

All rationals occur as exponents ⋮ An \(L\)-system on the small Witt design ⋮ Coloring of the square of Kneser graph \(K(2k+r,k)\) ⋮ Pseudo sunflowers ⋮ On squashed designs ⋮ Upper bounds for \(s\)-distance sets and equiangular lines ⋮ Exact solution of some Turán-type problems ⋮ Intersection theorems in permutation groups ⋮ A tale of stars and cliques ⋮ Improved bounds on the chromatic numbers of the square of Kneser graphs ⋮ Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths ⋮ Ranks of matrices with few distinct entries ⋮ On set intersections ⋮ Independent sets in hypergraphs omitting an intersection ⋮ Extremal Problems for Hypergraph Blowups of Trees ⋮ Intersecting families with sunflower shadows ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ Integer sequences without singleton intersection ⋮ Uniform hypergraphs under certain intersection constraints between hyperedges ⋮ Restricted \(t\)-wise \(\mathcal{L}\)-intersecting families on set systems ⋮ The structure of maximal non-trivial \(d\)-wise intersecting uniform families with large sizes ⋮ Bounds on sets with few distances ⋮ Bounds on three- and higher-distance sets ⋮ On Sperner families in which no k sets have an empty intersection. III ⋮ Intersection theorems with geometric consequences ⋮ Non-trivial \(d\)-wise intersecting families ⋮ On triangles in derangement graphs ⋮ The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations ⋮ Uniform eventown problems ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ Further results on Erdős–Faber–Lovász conjecture ⋮ Extension operations for cuts ⋮ Almost disjoint families of 3-term arithmetic progressions ⋮ Erdös–Ko–Rado Theorem—22 Years Later ⋮ A note on a conjecture by Füredi ⋮ On subsets with cardinalities of intersections divisible by a fixed integer ⋮ Stability versions of Erdős-Ko-Rado type theorems via isoperimetry ⋮ Linear trees in uniform hypergraphs ⋮ Cycles of given lengths in hypergraphs ⋮ Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems ⋮ Invitation to intersection problems for finite sets ⋮ Around Borsuk's hypothesis ⋮ Families of finite sets with three intersections ⋮ An Upper Bound for Weak $B_k$-Sets ⋮ Hypercube embedding of generalized bipartite metrics ⋮ Injection geometries ⋮ Forbidding just one intersection

This page was built for publication: Intersection Properties of Systems of Finite Sets