The minimum number of triangles covering the edges of a graph

DOI10.1002/JGT.3190130312zbMATH Open0715.05037OpenAlexW2062724169MaRDI QIDQ3201088FDOQ3201088

Jeno Lehel

Publication date: 1989

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190130312

Recommendations

• Covering and independence in triangle structures
• On a generalized Erdős–Rademacher problem
• Covering number product bounds size
• Independent triangles covering given vertices of a graph
• Packing and covering triangles in graphs

zbMATH Keywords

finite simple graphstriangle covering

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• The Representation of a Graph by Set Intersections

Cited In (2)

• Covering and independence in triangle structures
• The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs

This page was built for publication: The minimum number of triangles covering the edges of a graph

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