Year: 2013
Type: preprint
Abstract: The well-known Ramsey number $r(t,u)$ is the smallest integer $n$ such that every $K_t$-free graph of order $n$ contains an independent set of size $u$. In other words, it contains a subset of $u$ vertices with no $K_2$. Erd{\H o}s and Rogers introduced a more general problem replacing $K_2$ by $K_s$ for $2\le s
Source: arXiv (Cornell University)
Authors: Dudek, Andrzej, Mubayi, Dhruv
Institutions: Western Michigan University, University of Illinois Chicago
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Funder: National Science Foundation
OpenAlex ID: W2950103587