Decomposing Graphs into Edges and Triangles

被引:8
|
作者
Kral, Daniel [1 ,2 ]
Lidicky, Bernard [3 ]
Martins, Taisa L. [4 ]
Pehova, Yanitsa [4 ]
机构
[1] Univ Warwick, Math Inst, DIMAP, Coventry CV4 7AL, W Midlands, England
[2] Univ Warwick, Dept Comp Sci, Coventry CV4 7AL, W Midlands, England
[3] Iowa State Univ, Dept Math, Ames, IA 50011 USA
[4] Univ Warwick, Math Inst, Coventry CV4 7AL, W Midlands, England
来源
COMBINATORICS PROBABILITY & COMPUTING | 2019年 / 28卷 / 03期
基金
英国工程与自然科学研究理事会; 欧洲研究理事会;
关键词
INTEGER; DENSITY;
D O I
10.1017/S0963548318000421
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We prove the following 30 year-old conjecture of Gyori and Tuza: the edges of every n-vertex graph G can be decomposed into complete graphs C-1, ..., C-l of orders two and three such that vertical bar C-1 vertical bar+ ... + vertical bar C-l vertical bar (1/2 + o(1))n(2). This result implies the asymptotic version of the old result of Erdos, Goodman and POsa that asserts the existence of such a decomposition with l <= n(2)/4.
引用
收藏
页码:465 / 472
页数:8
相关论文
共 50 条
  • [31] Triangles and Girth in Disk Graphs and Transmission Graphs
    Kaplan, Haim
    Klost, Katharina
    Mulzer, Wolfgang
    Roditty, Liam
    Seiferth, Paul
    Sharir, Micha
    [J]. 27TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA 2019), 2019, 144
  • [32] Directed triangles in directed graphs
    de Graaf, M
    [J]. DISCRETE MATHEMATICS, 2004, 280 (1-3) : 219 - 223
  • [33] Crowdsourced Clustering: Querying Edges vs Triangles
    Vinayak, Ramya Korlakai
    Hassibi, Babak
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 29 (NIPS 2016), 2016, 29
  • [34] Triangles in randomly perturbed graphs
    Boettcher, Julia
    Parczyk, Olaf
    Sgueglia, Amedeo
    Skokan, Jozef
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2023, 32 (01): : 91 - 121
  • [35] Random triangles in random graphs
    Heckel, Annika
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2021, 59 (04) : 616 - 621
  • [36] Independent sets in graphs with triangles
    Hofmeister, T
    Lefmann, H
    [J]. INFORMATION PROCESSING LETTERS, 1996, 58 (05) : 207 - 210
  • [37] PACKING TRIANGLES IN WEIGHTED GRAPHS
    Chapuy, Guillaume
    Devos, Matt
    McDonald, Jessica
    Mohar, Bojan
    Scheide, Diego
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2014, 28 (01) : 226 - 239
  • [38] EXTREMAL GRAPHS FOR INTERSECTING TRIANGLES
    ERDOS, P
    FUREDI, Z
    GOULD, RJ
    GUNDERSON, DS
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1995, 64 (01) : 89 - 100
  • [39] On the minimal density of triangles in graphs
    Razborov, Alexander A.
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2008, 17 (04): : 603 - 618
  • [40] On Krein graphs without triangles
    Gavrilyuk, AL
    Makhnev, AA
    [J]. DOKLADY MATHEMATICS, 2005, 72 (01) : 591 - 594