Füredi, Zoltán and Maleki, Zeinab (2017) The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs. COMBINATORICS PROBABILITY & COMPUTING, 26 (4). pp. 525-535. ISSN 0963-5483
|
Text
1411.0771v2.pdf Download (644kB) | Preview |
Official URL: https://doi.org/10.1017/S0963548316000407
Abstract
We give an asymptotic formula for the minimum number of edges contained in triangles among graphs with n vertices and e edges. Our main tool is a generalization of Zykov's symmetrization method that can be applied to several graphs simultaneously. © 2017 Cambridge University Press.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Computer science; Symmetrization method; nocv1; Asymptotic formula; Probability |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 05 Dec 2017 09:58 |
| Last Modified: | 05 Dec 2017 09:58 |
| URI: | http://real.mtak.hu/id/eprint/70729 |
Actions (login required)
 |
Edit Item |
