Triangle packing and covering in dense random graphs

Zhongzheng Tang () and Zhuo Diao ()
Additional contact information
Zhongzheng Tang: Beijing University of Posts and Telecommunications
Zhuo Diao: Central University of Finance and Economics

Journal of Combinatorial Optimization, 2022, vol. 44, issue 4, No 50, 3153-3164

Abstract: Abstract Given a simple graph $$G=(V,E)$$ G = ( V , E ) , a subset of E is called a triangle cover if it intersects each triangle of G. Let $$\nu _t(G)$$ ν t ( G ) and $$\tau _t(G)$$ τ t ( G ) denote the maximum number of pairwise edge-disjoint triangles in G and the minimum cardinality of a triangle cover of G, respectively. Tuza (in: Finite and infinite sets, proceedings of Colloquia Mathematica Societatis, Janos Bolyai, p 888, 1981) conjectured in 1981 that $$\tau _t(G)/\nu _t(G)\le 2$$ τ t ( G ) / ν t ( G ) ≤ 2 holds for every graph G. In this paper, we consider Tuza’s Conjecture on dense random graphs. Under $$\mathcal {G}(n,p)$$ G ( n , p ) model with a constant p, we prove that the ratio of $$\tau _t(G)$$ τ t ( G ) and $$\nu _t(G)$$ ν t ( G ) has the upper bound close to 1.5 with high probability. Furthermore, the ratio 1.5 is nearly the best result when $$p\ge 0.791$$ p ≥ 0.791 . In some sense, on dense random graphs, these conclusions verify Tuza’s Conjecture.

Keywords: Triangle cover; Triangle packing; Random graph; $${\mathcal {G}}\left( n; p\right) $$ G n; p model (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-022-00859-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:44:y:2022:i:4:d:10.1007_s10878-022-00859-w

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-022-00859-w

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().