A set intersection theorem and an application to a bipartite Ramsey theorem

DOI10.1016/S0012-365X(01)00170-4MaRDI QIDQ5957764zbMATH OpenOpenAlexFDO

Authors Mark Ramras

Publication date 7 August 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(01)00170-4

zbMATH Keywords

bipartiteRamseyset intersection

Mathematics Subject Classification ID

Ramsey theory (05D10)

Review text

The existence of certain subfamilies of families of finite sets is proven. In particular, it is shown that given any integer \(k \geq 2\) there exists an integer \(n\) such that any family of \(n\) \(n\)-sets in \([2n-1]\) contains a subfamily of \(k\) of these \(n\) sets with at least \(k\) elements in common. This result can be used for an alternative proof of a Ramsey-type theorem for bipartite graphs.

Recommendations

• scientific article; zbMATH DE number 1552836
• scientific article; zbMATH DE number 398949
• Publication:5750908
• scientific article; zbMATH DE number 4193722
• An intersection theorem for systems of sets

Cited in

(5)

• Restriction and intersection theorems -- the nonmonotone case
• scientific article; zbMATH DE number 1552836 (Why is no real title available?)
• scientific article; zbMATH DE number 4193722 (Why is no real title available?)
• scientific article; zbMATH DE number 4185671 (Why is no real title available?)
• Bipartite sets of spheres and Casey-type theorems

This page was built for publication: A set intersection theorem and an application to a bipartite Ramsey theorem

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