Gruslys, V;
Letzter, S;
(2018)
Minimizing the Number of Triangular Edges.
Combinatorics, Probability and Computing
, 27
(4)
pp. 580-622.
10.1017/s0963548317000189.
Preview |
Text
triangle-corrected.pdf - Accepted Version Download (536kB) | Preview |
Abstract
We consider the problem of minimizing the number of edges that are contained in triangles, among n-vertex graphs with a given number of edges. For sufficiently large n, we prove an exact formula for this minimum, which partially resolves a conjecture of Füredi and Maleki.
| Type: | Article |
|---|---|
| Title: | Minimizing the Number of Triangular Edges |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1017/s0963548317000189 |
| Publisher version: | https://doi.org/10.1017/S0963548317000189 |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher's terms and conditions. |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences > Dept of Mathematics |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10107276 |
Downloads since deposit
40Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months
Archive Staff Only
 |
View Item |
