Triangle packing and covering in dense random graphs
type: Item
instance of: scholarly article
title: Triangle packing and covering in dense random graphs
zbMATH Open document ID: 1504.90135
author: Zhongzheng Tang
author: Zhuo Diao
published in: Journal of Combinatorial Optimization
publication date: 2022-10-18T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7603310
zbMATH Keywords: \({\mathcal{G}}\left(n, p\right)\) model
MaRDI profile type: Publication
full work available at URL: s10878-022-00859-w
OpenAlex ID: W4224884357
cites work: Q3503433
cites work: On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs
cites work: Large triangle packings and Tuza’s conjecture in sparse random graphs
cites work: On Tuza's conjecture for triangulations and graphs with small treewidth
cites work: Multi-transversals for Triangles and the Tuza's Conjecture
cites work: Packing Triangles in Weighted Graphs
cites work: Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles
cites work: Total Dual Integrality of Triangle Covering
cites work: Covering triangles in edge-weighted graphs
cites work: Covering and independence in triangle structures
cites work: Packing and covering triangles in graphs
cites work: Packing and covering triangles in tripartite graphs
cites work: Integer and fractional packings in dense graphs
cites work: Packing and covering triangles in \(K_{4}\)-free planar graphs
cites work: A stability theorem on fractional covering of triangles by edges
cites work: On a conjecture of Tuza about packing and covering of triangles
cites work: Triangle Factors in Random Graphs
cites work: Small edge sets meeting all triangles of a graph
cites work: Induced cycles in triangle graphs
cites work: Probability and Computing
cites work: Triangle packings and transversals of some \(K_{4}\)-free graphs
cites work: Tuza's conjecture for graphs with maximum average degree less than 7
cites work: Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture
cites work: Matching and covering the vertices of a random graph by copies of a given graph
cites work: Packing and covering triangles in dense random graphs
cites work: A conjecture on triangles of graphs
cites work: Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing
DOI: 10.1007/S10878-022-00859-W
description: scientific article; zbMATH DE number 7603310