Author:
ALON NOGA,BALOGH JÓZSEF,KOSTOCHKA ALEXANDR,SAMOTIJ WOJCIECH
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.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference13 articles.
1. Some of my favorite problems in various branches of combinatorics;Erdős;Matematiche (Catania),1992
2. [10] Erdős P. and Hajnal A. (1977) On spanned subgraphs of graphs. In Contributions to Graph Theory and its Applications (Internat. Colloq., Oberhof, 1977), pp. 80–96.
3. Properly colored Hamilton cycles in edge-colored complete graphs
4. Induced subgraphs of prescribed size
5. On a Ramsey type theorem
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献