Combinatorial properties of systems of sets (Q1248627): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0097-3165(78)90060-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013188591 / rank
 
Normal rank

Revision as of 18:54, 19 March 2024

scientific article
Language Label Description Also known as
English
Combinatorial properties of systems of sets
scientific article

    Statements

    Combinatorial properties of systems of sets (English)
    0 references
    0 references
    0 references
    1978
    0 references
    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.
    0 references

    Identifiers