Xi-He Li

Ramsey-type results for threshold graphs and beyond

A {\it threshold graph} is a graph that can be constructed from the one-vertex graph by repeatedly adding either a dominating vertex or an isolated vertex. Motivated by an induced Ramsey-type problem for this class, we define $r'_2(s)$ to be the minimum integer $n$ such that every $n$-vertex graph contains an induced t...