Combinatorial properties of systems of sets

DOI10.1016/0097-3165(78)90060-2MaRDI QIDQ1248627zbMATH OpenOpenAlexWikidataFDO

Authors P. Erdős, Endre Szemerédi

Publication date 1978

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(78)90060-2

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Permutations, words, matrices (05A05) Other combinatorial number theory (11B75)

Review text

A family of sets is called a strong (weak) \(\triangle\) system if the (cardinality of the) intersection of any two of its members is the same. The paper contains remarks, considerations, conjectures and results on the following functions: \(f(n,r) =\) smallest integer for which any family of \(f(n,r)\) sets of size \(n\) contains a subfamily of \(r\) sets which forms a strong \(\triangle\) system; \(g(n,r)\) is defined similarly for weak \(\triangle\) systems; \(F(n,r) =\) largest integer so that there is a family of subsets of an \(n\)-set which does not contain a strong \(\triangle\) system of \(r\) elements; \(G(n,r)\) has the similar meaning for weak \(\triangle\) systems; \(F(n,r,k)\) and \(G(n,r,k)\) are defined similarly with the sole distinction that only \(k\)-subsets are considered. The existence is proved of families of subsets of an \(n\)-set not containing weak \(\triangle\) systems and having at least \(n^{\log n/4 \log\log n}\) members.

Recommendations

• Intersection statements for systems of sets
• On the size of set systems on \([n]\) not containing weak \((r,\Delta)\)-systems
• On large systems of sets with no large weak \(\Delta\)-subsystems
• Structure and stability of triangle-free set systems
• Intersection theorems for systems of sets (III)

Cites work

• Intersection theorems for systems of sets (III)
• Note on a Property of Measurable Sets

Cited in

(37)

• Families of finite sets in which no set is covered by the union of \(r\) others
• On the combinatorial problems which I would most like to see solved
• On set systems not containing delta systems
• Intersection statements for systems of sets
• On the size of set systems on \([n]\) not containing weak \((r,\Delta)\)-systems
• Combinatorial analysis. (Matrix problems, choice theory)
• On set systems without weak 3-\(\Delta\)-subsystems
• On the extremal combinatorics of the Hamming space
• Improved bounds for the sunflower lemma
• Proof of a conjecture of Erdős on triangles in set-systems
• Specified intersections
• 2-cancellative hypergraphs and codes
• Structure and stability of triangle-free set systems
• On sunflowers and matrix multiplication
• scientific article; zbMATH DE number 3957109 (Why is no real title available?)
• Forbidden Intersections
• scientific article; zbMATH DE number 4031697 (Why is no real title available?)
• scientific article; zbMATH DE number 4039941 (Why is no real title available?)
• scientific article; zbMATH DE number 3657816 (Why is no real title available?)
• Equicovering subgraphs of graphs and hypergraphs
• scientific article; zbMATH DE number 610247 (Why is no real title available?)
• Multicolour sunflowers
• New applications of the polynomial method: the cap set conjecture and beyond
• On cap sets and the group-theoretic approach to matrix multiplication
• Exchange properties of finite set-systems
• UPPER BOUNDS FOR SUNFLOWER-FREE SETS
• Delta-systems and qualitative (in)dependence
• Near-sunflowers and focal families
• Odd-sunflowers
• Towards odd-sunflowers: temperate families and lightnings
• Cutting corners
• Set systems and families of permutations with small traces
• Partition rank and partition lattices
• Odd-sunflowers (extended abstract)
• Sunflowers in set systems of bounded dimension
• Focal-free uniform hypergraphs and codes
• Constructions and bounds for \((m,t)\)-splitting systems

This page was built for publication: Combinatorial properties of systems of sets

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