An Extremal Set-Intersection Theorem

DOI10.1112/jlms/s2-9.2.355zbMath0296.05002OpenAlexW2083556234MaRDI QIDQ4049075

No author found.

Publication date: 1974

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

Full work available at URL: https://doi.org/10.1112/jlms/s2-9.2.355

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items

Hypergraphs without non-trivial intersecting subgraphs, Exact solution of some Turán-type problems, The junta method in extremal hypergraph theory and Chvátal's conjecture, Unavoidable subhypergraphs: \(\mathbf a\)-clusters, Set systems without a 3-simplex, On a problem of Chvatal and Erdoes on hypergraphs containing no generalized simplex, Turán problems and shadows. I: Paths and cycles, New results on simplex-clusters in set systems, The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture, Simplex Stability, Set systems without a simplex or a cluster, Helly property in finite set systems, Partitioning ordered hypergraphs, Note on set systems without a strong simplex, On set systems without a simplex-cluster and the junta method, On the \(d\)-cluster generalization of Erdős-Ko-Rado, Invitation to intersection problems for finite sets, Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs, On ordered set systems and some conjectures related to the erdös–ko–rado theorem and turán's theorem, Set systems with union and intersection constraints, A homological approach to two problems on finite sets, Structure and stability of triangle-free set systems, Unavoidable subhypergraphs: a-clusters