Sciweavers

JGT
2007
85views more  JGT 2007»
13 years 4 months ago
On graphs with subgraphs having large independence numbers
: Let G be a graph on n vertices in which every induced subgraph on s = log3 n vertices has an independent set of size at least t = log n. What is the largest q = q(n) so that ever...
Noga Alon, Benny Sudakov