Large triangle packings and Tuza’s conjecture in sparse random graphs
2020 ◽
Vol 29
(5)
◽
pp. 757-779
◽
Keyword(s):
AbstractThe triangle packing number v(G) of a graph G is the maximum size of a set of edge-disjoint triangles in G. Tuza conjectured that in any graph G there exists a set of at most 2v(G) edges intersecting every triangle in G. We show that Tuza’s conjecture holds in the random graph G = G(n, m), when m ⩽ 0.2403n3/2 or m ⩾ 2.1243n3/2. This is done by analysing a greedy algorithm for finding large triangle packings in random graphs.
Keyword(s):
2018 ◽
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
2013 ◽
Vol 21
(supp01)
◽
pp. 63-74
◽
Keyword(s):
1975 ◽
Vol 77
(2)
◽
pp. 313-324
◽
2013 ◽
Vol 22
(6)
◽
pp. 829-858
◽
Keyword(s):