New bounds on the size of nearly perfect matchings in almost regular hypergraphs (Q6139785): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1112/jlms.12792 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W3092384090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly perfect matchings in regular simple hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a hypergraph matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of Latin square graphs / 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: Q3998725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Triple Systems with High Chromatic Index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5740311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom hypergraph matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5734432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long gaps between primes / 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: The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically optimal covering designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly-perfect hypergraph packing is in NC / 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: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically good list-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear programming perspective on the Frankl?R�dl?Pippenger theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds for Ryser’s conjecture and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4705347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the difference between asymptotically good packings and coverings / 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: The Chromatic Index of Projective Triple Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3410615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal list colorings / 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: Q5661892 / 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: Transversals of latin squares and their generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hanani triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help / rank
 
Normal rank
Property / cites work
 
Property / cites work: An existence theory for pairwise balanced designs. I: Composition theorems and morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An existence theory for pairwise balanced designs. III: Proof of the existence conjectures / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1112/JLMS.12792 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:48, 30 December 2024

scientific article; zbMATH DE number 7780659
Language Label Description Also known as
English
New bounds on the size of nearly perfect matchings in almost regular hypergraphs
scientific article; zbMATH DE number 7780659

    Statements

    New bounds on the size of nearly perfect matchings in almost regular hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 December 2023
    0 references
    almost regular hypergraphs
    0 references
    perfect matching
    0 references
    Steiner triple systems
    0 references
    chromatic index
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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