Name
Abstract | ||
|---|---|---|
We show that if r=s=2,nr^8, and G is a graph of order n containing as many r-cliques as the r-partite Turan graph of order n, then G has more than n^r^-^1/r^2^r^+^1^2 cliques sharing a common edge unless G is isomorphic to the r-partite Turan graph of order n. This structural result generalizes a previous result that has been useful in extremal graph theory. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.ejc.2010.07.010 | Eur. J. Comb. |
Keywords | Field | DocType |
order n,structural result,common edge,extremal graph theory,r-partite turan graph,large joint,previous result | Discrete mathematics,Combinatorics,Line graph,Vertex-transitive graph,Graph power,Symmetric graph,Graph minor,Extremal graph theory,Voltage graph,Mathematics,Complement graph | Journal |
Volume | Issue | ISSN |
32 | 1 | 0195-6698 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Béla Bollobás | 1 | 2696 | 474.16 |
| Vladimir Nikiforov | 2 | 124 | 20.26 |