Triangle packing and covering in dense random graphs
From MaRDI portal
Publication:2084667
DOI10.1007/s10878-022-00859-wzbMath1504.90135OpenAlexW4224884357MaRDI QIDQ2084667
Publication date: 18 October 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-022-00859-w
Cites Work
- Unnamed Item
- Induced cycles in triangle graphs
- A stability theorem on fractional covering of triangles by edges
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture
- Covering triangles in edge-weighted graphs
- On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs
- Integer and fractional packings in dense graphs
- Matching and covering the vertices of a random graph by copies of a given graph
- Packing and covering triangles in graphs
- Packing and covering triangles in tripartite graphs
- On a conjecture of Tuza about packing and covering of triangles
- Covering and independence in triangle structures
- Packing and covering triangles in \(K_{4}\)-free planar graphs
- Small edge sets meeting all triangles of a graph
- A conjecture on triangles of graphs
- Tuza's conjecture for graphs with maximum average degree less than 7
- Triangle packings and transversals of some \(K_{4}\)-free graphs
- Packing and covering triangles in dense random graphs
- Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles
- Total Dual Integrality of Triangle Covering
- Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing
- Triangle Factors in Random Graphs
- Packing Triangles in Weighted Graphs
- Large triangle packings and Tuza’s conjecture in sparse random graphs
- Multi-transversals for Triangles and the Tuza's Conjecture
- Probability and Computing
- On Tuza's conjecture for triangulations and graphs with small treewidth
This page was built for publication: Triangle packing and covering in dense random graphs
