Nearly perfect matchings in regular simple hypergraphs (Q1366948): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jeong Han Kim / rank
Normal rank
 
Property / author
 
Property / author: J. H. Spencer / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Vladimir D. Tonchev / rank
Normal rank
 
Property / author
 
Property / author: Jeong Han Kim / rank
 
Normal rank
Property / author
 
Property / author: J. H. Spencer / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Vladimir D. Tonchev / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dense infinite Sidon sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of a Maximum Transversal in a Steiner Triple System / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5734432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near perfect coverings in graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically optimal covering designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: More-than-nearly-perfect packings and partial designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically good list-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on partial parallel classes in Steiner systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behavior of the chromatic index for hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a packing and covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4885222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic packing via a branching process / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of Partial Parallel Classes in Steiner Systems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02773639 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971289435 / rank
 
Normal rank

Latest revision as of 09:54, 30 July 2024

scientific article
Language Label Description Also known as
English
Nearly perfect matchings in regular simple hypergraphs
scientific article

    Statements

    Nearly perfect matchings in regular simple hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    17 September 1997
    0 references
    New bounds on matchings in \(k\)-uniform regular hypergraphs with \(k\geq 3\) and such that every two edges share at most one vertex are proved. In particular, an improved bound on matchings in Steiner triple systems is obtained.
    0 references
    matchings
    0 references
    regular hypergraphs
    0 references
    Steiner triple systems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references