scientific article; zbMATH DE number 903456
From MaRDI portal
DOI<161::AID-RSA1>3.0.CO;2-W 10.1002/(SICI)1098-2418(199605)8:3<161::AID-RSA1>3.0.CO;2-WzbMath0856.05074MaRDI QIDQ4885222
Publication date: 15 July 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Nearly-perfect hypergraph packing is in NC, Fractional v. integral covers in hypergraphs of bounded edge size, Nearly perfect matchings in regular simple hypergraphs, On asymptotic packing of convex geometric and ordered graphs, Graph and hypergraph colouring via nibble methods: a survey, New bounds on the size of nearly perfect matchings in almost regular hypergraphs, Threshold for Steiner triple systems, On the Method of Typical Bounded Differences, Unnamed Item, On a conjecture of Erdős on locally sparse Steiner triple systems, Inapproximability of b-Matching in k-Uniform Hypergraphs, Triangle-free subgraphs of hypergraphs, A natural barrier in random greedy hypergraph matching, The Reverse H‐free Process for Strictly 2‐Balanced Graphs, Random triangle removal
