An upper bound on the number of Steiner triple systems (Q2868080): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The maximum number of perfect matchings in graphs with a given degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: An entropy proof of the Kahn-Lovász theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalisation of \(t\)-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An entropy proof of Bregman's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonisomorphic Steiner triple systems / rank
 
Normal rank

Latest revision as of 05:09, 7 July 2024

scientific article
Language Label Description Also known as
English
An upper bound on the number of Steiner triple systems
scientific article

    Statements

    An upper bound on the number of Steiner triple systems (English)
    0 references
    0 references
    0 references
    0 references
    23 December 2013
    0 references
    0 references
    combinatorial enumeration
    0 references
    Steiner triple systems
    0 references
    entropy method
    0 references
    asymptotics
    0 references
    0 references
    0 references