Large triangle packings and Tuza’s conjecture in sparse random graphs
From MaRDI portal
Publication:4987259
DOI10.1017/S0963548320000115zbMath1462.05323arXiv1810.11739OpenAlexW3045198963WikidataQ123101908 ScholiaQ123101908MaRDI QIDQ4987259
Patrick Bennett, Andrzej Dudek, Shira Zerbib
Publication date: 30 April 2021
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.11739
Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Density (toughness, etc.) (05C42)
Related Items (4)
Tuza's conjecture for random graphs ⋮ Closing the Random Graph Gap in Tuza's Conjecture through the Online Triangle Packing Process ⋮ The sum-free process ⋮ Triangle packing and covering in dense random graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Integer and fractional packings in dense graphs
- Handbook of large-scale random networks
- The triangle-free process
- Near perfect coverings in graphs and hypergraphs
- On tail probabilities for martingales
- Packing and covering triangles in graphs
- On a conjecture of Tuza about packing and covering of triangles
- Random triangle removal
- On some extremal problems in graph theory
- On a hypergraph matching problem
- Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing
- To Prove and Conjecture: Paul Erdos and His Mathematics
- On the size of a random maximal graph
- A generalization of Tuza's conjecture
- The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
- The Reverse H‐free Process for Strictly 2‐Balanced Graphs
- On the Method of Typical Bounded Differences
- Tuza's Conjecture is Asymptotically Tight for Dense Graphs
- Dynamic concentration of the triangle-free process
This page was built for publication: Large triangle packings and Tuza’s conjecture in sparse random graphs
