scientific article; zbMATH DE number 1380611

DOI10.1002/(SICI)1098-2418(199810/12)13:3/4%3C335::AID-RSA8%3E3.0.CO;2-WzbMATH Open0959.05079MaRDI QIDQ4705347FDOQ4705347

Vojtěch Rödl, Alexandr Kostochka

Publication date: 19 December 1999

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

matchinghypergraphsSteiner systems

Mathematics Subject Classification ID

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

Cited In (14)

• New bounds on the size of nearly perfect matchings in almost regular hypergraphs
• Nearly optimal partial Steiner systems
• A Construction of Almost Steiner Systems
• Extremal problems in hypergraph colourings
• New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
• Every Steiner triple system contains almost spanning \(d\)-ary hypertree
• Graph and hypergraph colouring via nibble methods: a survey
• Title not available (Why is that?)
• Concentration of non‐Lipschitz functions and applications
• A natural barrier in random greedy hypergraph matching
• Colorful Matchings
• Near-perfect clique-factors in sparse pseudorandom graphs
• Near-perfect clique-factors in sparse pseudorandom graphs
• Independence numbers of Johnson-type 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)