A New Lower Bound For A Ramsey-Type Problem |
| |
Authors: | Benny Sudakov |
| |
Institution: | (1) Department of Mathematics, Princeton University and Institute for Advanced Study, Princeton, NJ 08540, USA |
| |
Abstract: | Let 3 ≤ r < s be fixed integers and let G be a graph on n vertices not containing a complete graph on s vertices. The main aim of this paper is to provide a new lower bound on the size of the maximum subset of G without a copy of complete graph Kr. Our results substantially improve previous bounds of Krivelevich and Bollobás and Hind.
* Research supported in part by NSF grants DMS-0106589, CCR-9987845 and by the State of New Jersey. Part of this research
was done while visiting Microsoft Research. |
| |
Keywords: | 05C35 05C55 05D10 |
本文献已被 SpringerLink 等数据库收录! |
|