Typical large graphs with given edge and triangle densities

被引:1
|
作者
Neeman, Joe [1 ]
Radin, Charles [1 ]
Sadun, Lorenzo [1 ]
机构
[1] Univ Texas Austin, Dept Math, Austin, TX 78712 USA
关键词
60B20; 05C80; 60F10;
D O I
10.1007/s00440-023-01187-8
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
The analysis of large simple graphs with extreme values of the densities of edges and triangles has been extended to the statistical structure of typical graphs of fixed intermediate densities, by the use of large deviations of Erdos-Renyi graphs. We prove that the typical graph exhibits sharp singularities as the constraining densities vary between different curves of extreme values, and we determine the precise nature of the singularities. The extension to graphs with fixed densities of edges and k-cycles for odd k > 3 is straightforward and we note the simple changes in the proof.
引用
收藏
页码:1167 / 1223
页数:57
相关论文
共 50 条
  • [1] Typical large graphs with given edge and triangle densities
    Joe Neeman
    Charles Radin
    Lorenzo Sadun
    [J]. Probability Theory and Related Fields, 2023, 186 : 1167 - 1223
  • [2] On graphs with a large number of edge-colorings avoiding a rainbow triangle
    Hoppen, Carlos
    Lefmann, Hanno
    Odermann, Knut
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2017, 66 : 168 - 190
  • [3] The structure of the typical graphs of given diameter
    Fueredi, Zoltan
    Kim, Younjin
    [J]. DISCRETE MATHEMATICS, 2013, 313 (02) : 155 - 163
  • [4] GRAPHS WITH A GIVEN EDGE NEIGHBORHOOD
    FRONCEK, D
    [J]. CZECHOSLOVAK MATHEMATICAL JOURNAL, 1989, 39 (04) : 627 - 630
  • [5] CONNECTED GRAPHS WITH EVERY EDGE IN A TRIANGLE
    CALLAN, D
    [J]. AMERICAN MATHEMATICAL MONTHLY, 1990, 97 (09): : 848 - 849
  • [6] Quartic Graphs with Every Edge in a Triangle
    Pfender, Florian
    Royle, Gordon F.
    [J]. JOURNAL OF GRAPH THEORY, 2016, 82 (02) : 154 - 164
  • [7] Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing
    Yuster, Raphael
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2012, 21 (06): : 952 - 962
  • [8] THE TYPICAL STRUCTURE OF MAXIMAL TRIANGLE-FREE GRAPHS
    Balogh, Jozsef
    Liu, Hong
    Petrickova, Sarka
    Sharifzadeh, Maryam
    [J]. FORUM OF MATHEMATICS SIGMA, 2015, 3
  • [9] Edge-Based Wedge Sampling to Estimate Triangle Counts in Very Large Graphs
    Turkoglu, Duru
    Turk, Ata
    [J]. 2017 17TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2017, : 455 - 464
  • [10] ON THE EDGE DISTRIBUTION IN TRIANGLE-FREE GRAPHS
    KRIVELEVICH, M
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1995, 63 (02) : 245 - 260