Sizes of Induced Subgraphs of Ramsey Graphs
2009 ◽
Vol 18
(4)
◽
pp. 459-476
◽
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.
2017 ◽
Vol 27
(1)
◽
pp. 110-123
◽
Keyword(s):
Keyword(s):
Keyword(s):
2013 ◽
Vol 05
(03)
◽
pp. 1350012
◽
2017 ◽
Vol 166
(1)
◽
pp. 61-74
◽
Keyword(s):
1992 ◽
Vol 1
(4)
◽
pp. 335-349
◽
Keyword(s):
Keyword(s):
2009 ◽
Vol Vol. 11 no. 1
(Graph and Algorithms)
◽
Keyword(s):