scientific article; zbMATH DE number 3931058

MaRDI QIDQ3705487zbMATH OpenFDO

Authors C. Vercellis

Publication date 1985

zbMATH Keywords

analysis of algorithmsmultiple coveringprobabilistic algorithmsrandom hypergraphsthreshold function

Mathematics Subject Classification ID

Hypergraphs (05C65) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Recommendations

• Covering the edges of a random hypergraph by cliques
• On covering numbers of regular hypergraphs
• Near perfect coverings in graphs and hypergraphs
• The distributions of the numbers of finite subgraphs in random nonhomogeneous hypergraphs
• The multiple-orientability thresholds for random hypergraphs

Cited in

(3)

• Threshold progressions in covering and packing contexts
• Covering the edges of a random hypergraph by cliques
• The Multiple-Orientability Thresholds for Random Hypergraphs

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 Q3705487)