Sciweavers

Share
COMBINATORICS
2004
93views more  COMBINATORICS 2004»
8 years 12 months ago
Degree Powers in Graphs with Forbidden Subgraphs
For every real p > 0 and simple graph G, set f (p, G) = uV (G) dp (u) , and let (r, p, n) be the maximum of f (p, G) taken over all Kr+1-free graphs G of order n. We prove tha...
Béla Bollobás, Vladimir Nikiforov
books