Name
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1017/S0963548316000110 | COMBINATORICS PROBABILITY & COMPUTING |
Field | DocType | Volume |
Discrete mathematics,Graph,Combinatorics,Homomorphism,Mathematics | Journal | 26 |
Issue | ISSN | Citations |
1 | 0963-5483 | 11 |
PageRank | References | Authors |
0.87 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oleg Pikhurko | 1 | 318 | 47.03 |
| Alexander A. Razborov | 2 | 1163 | 94.80 |