More-than-nearly-perfect packings and partial designs

DOI10.1007/s004930050053zbMath0929.05065OpenAlexW1964818456MaRDI QIDQ1125617

David A. Grable

Publication date: 8 December 1999

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930050053

zbMATH Keywords

hypergraphcoveringdegreepackinguniform hypergraphregular hypergraphcodegree

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Triple systems (05B07)

Related Items (10)

Nearly-perfect hypergraph packing is in NC ⋮ Concentration of non‐Lipschitz functions and applications ⋮ Fractional v. integral covers in hypergraphs of bounded edge size ⋮ Nearly perfect matchings in regular simple hypergraphs ⋮ A Construction of Almost Steiner Systems ⋮ Induced Decompositions of Highly Dense Graphs ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Independence numbers of Johnson-type graphs ⋮ New bounds on the size of nearly perfect matchings in almost regular hypergraphs ⋮ Cliques in Steiner systems

This page was built for publication: More-than-nearly-perfect packings and partial designs