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

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q106084760, #quickstatements; #temporary_batch_1719531041801
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Intersection theorems for systems of sets (III) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on a Property of Measurable Sets / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q106084760 / rank
 
Normal rank

Latest revision as of 00:32, 28 June 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