An Extremal Set-Intersection Theorem

DOI10.1112/JLMS/S2-9.2.355MaRDI QIDQ4049075zbMATHOpenAlexFDO

Authors

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)

Cited in

(23)

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

This page was built for publication: An Extremal Set-Intersection Theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4049075)