Article contents
Sizes of Induced Subgraphs of Ramsey Graphs
Published online by Cambridge University Press: 01 July 2009
Abstract
An n-vertex graph G is c-Ramsey if it contains neither a complete nor an empty induced subgraph of size greater than c log n. Erdős, Faudree and Sós conjectured that every c-Ramsey graph with n vertices contains Ω(n5/2) induced subgraphs, any two of which differ either in the number of vertices or in the number of edges, i.e., the number of distinct pairs (|V(H)|, |E(H)|), as H ranges over all induced subgraphs of G, is Ω(n5/2). We prove an Ω(n2.3693) lower bound.
- Type
- Paper
- Information
- Copyright
- Copyright © Cambridge University Press 2009
References
- 7
- Cited by