scientific article; zbMATH DE number 1380611
From MaRDI portal
Publication:4705347
DOI<335::AID-RSA8>3.0.CO;2-W 10.1002/(SICI)1098-2418(199810/12)13:3/4<335::AID-RSA8>3.0.CO;2-WzbMath0959.05079MaRDI QIDQ4705347
Vojtěch Rödl, Alexandr V. Kostochka
Publication date: 19 December 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Concentration of non‐Lipschitz functions and applications ⋮ Every Steiner triple system contains almost spanning \(d\)-ary hypertree ⋮ A Construction of Almost Steiner Systems ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Colorful Matchings ⋮ Independence numbers of Johnson-type graphs ⋮ New bounds on the size of nearly perfect matchings in almost regular hypergraphs ⋮ Extremal problems in hypergraph colourings ⋮ Near-perfect clique-factors in sparse pseudorandom graphs ⋮ New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help ⋮ Near-perfect clique-factors in sparse pseudorandom graphs ⋮ A natural barrier in random greedy hypergraph matching
This page was built for publication:
