Asymptotic Structure of Graphs with the Minimum Number of Triangles-Reference-Cited by-同舟云学术

Asymptotic Structure of Graphs with the Minimum Number of Triangles

Published:2016-05-04 Issue:1 Volume:26 Page:138-160
ISSN:0963-5483
Container-title:Combinatorics, Probability and Computing
language:en
Short-container-title:Combinator. Probab. Comp.

Author:

PIKHURKO OLEG,RAZBOROV ALEXANDER

Abstract

We consider the problem of minimizing the number of triangles in a graph of given order and size, and describe the asymptotic structure of extremal graphs. This is achieved by characterizing the set of flag algebra homomorphisms that minimize the triangle density.

Publisher

Cambridge University Press (CUP)

Subject

Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science

Reference39 articles.

1. Problem 28;Mantel;Winkundige Opgaven,1907

2. Emergent Structures in Large Networks

3. Lubetzky E. and Zhao Y. (2014) On the variational problem for upper tails in sparse random graphs. arXiv:1402.6011

4. The number of cliques in graphs of given order and size

5. Simonovits M. (1968) A method for solving extremal problems in graph theory, stability problems. In Theory of Graphs: Tihany 1966, Academic, pp. 279–319.

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Typical large graphs with given edge and triangle densities;Probability Theory and Related Fields;2023-01-17

2. An Interview with Alexander Razborov;The Mathematical Intelligencer;2022-06-06

3. Approximating the Cumulant Generating Function of Triangles in the Erdös–Rényi Random Graph;Journal of Statistical Physics;2021-01-25

4. Combinatorics;Landscape of 21st Century Mathematics;2021

5. Asymptotic Structure for the Clique Density Theorem;discrete Analysis;2020-12-30