Packing and covering triangles in dense random graphs

DOI10.1007/978-3-030-64843-5_29MaRDI QIDQ2692229zbMATH OpenOpenAlexFDO

Authors Zhongzheng Tang, Zhuo Diao

Publication date 21 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-64843-5_29

zbMATH Keywords

\(\mathcal{G}(n,m)\) model\(\mathcal{G}(n,p)\) modelrandom graphtriangle covertriangle packing

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Cited in

(4)

• Packing and covering triangles in graphs
• Triangle packing and covering in dense random graphs
• Random Covering and Packing on the Line
• Packing and covering triangles in planar graphs

This page was built for publication: Packing and covering triangles in dense random graphs

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