Name
Abstract | ||
|---|---|---|
In 1969 Erdos proved that if r>=2 and n>n"0(r), every graph G of order n and e(G)>t"r(n) has an edge that is contained in at least n^r^-^1/(10r)^6^r cliques of order (r+1). In this note we improve this bound to n^r^-^1/r^r^+^5. We also prove a corresponding stability result. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.disc.2007.03.045 | Discrete Mathematics |
Keywords | Field | DocType |
extremal graph,jointsize,book,joint,stability,clique,lower bound | Discrete mathematics,Graph,Combinatorics,Clique,Numerical stability,Mathematics | Journal |
Volume | Issue | ISSN |
308 | 1 | Discrete Mathematics |
Citations | PageRank | References |
7 | 1.06 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Béla Bollobás | 1 | 2696 | 474.16 |
| Vladimir Nikiforov | 2 | 124 | 20.26 |