scientific article; zbMATH DE number 1380611

DOI10.1002/(SICI)1098-2418(199810/12)13:3/4%3C335::AID-RSA8%3E3.0.CO;2-WMaRDI QIDQ4705347zbMATH OpenFDO

Authors Vojtěch Rödl, Alexandr Kostochka

Publication date 19 December 1999

zbMATH Keywords

matchinghypergraphsSteiner systems

Mathematics Subject Classification ID

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

Recommendations

• Nearly perfect matchings in regular simple hypergraphs
• On a hypergraph matching problem
• More-than-nearly-perfect packings and partial designs
• Near perfect matchings in \(k\)-uniform hypergraphs
• Perfect matchings in large uniform hypergraphs with large minimum collective degree

Cited in

(14)

• A construction of almost Steiner systems
• scientific article; zbMATH DE number 1052829 (Why is no real title available?)
• A natural barrier in random greedy hypergraph matching
• Every Steiner triple system contains almost spanning \(d\)-ary hypertree
• New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
• Independence numbers of Johnson-type graphs
• Extremal problems in hypergraph colourings
• Concentration of non‐Lipschitz functions and applications
• Graph and hypergraph colouring via nibble methods: a survey
• Colorful Matchings
• New bounds on the size of nearly perfect matchings in almost regular hypergraphs
• Near-perfect clique-factors in sparse pseudorandom graphs
• Nearly optimal partial Steiner systems
• Near-perfect clique-factors in sparse pseudorandom graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4705347)