Ramsey-type results for threshold graphs and beyond

Abstract

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^{\prime }(s)$ to be the minimum integer $n$ such that every $n$-vertex graph contains an induced threshold graph on $s$ vertices. We establish exponential upper and lower bounds for $r_2^{\prime }(s)$ and determine its exact values for $s\in \{3,4,5,6\}$. To study this problem from an edge-coloring perspective, we use the notion of an orderable coloring, introduced by Richer [{\it J. Combin. Theory Ser. B}, 80(1) (2000), 172--177]. An edge-colored graph is {\it orderable} if its vertices can be ordered so that, for each vertex, all edges from it to later vertices have the same color. Equivalently, $r_2^{\prime }(s)$ is the minimum $n$ such that every $2$-edge-coloring of $K_n$ contains an orderable $K_s$. We also determine the exact value of the unordered canonical Ramsey number $CR(s,3)$ for all $s\ge 3$, where $CR(s,3)$ denotes the minimum integer $n$ such that every edge-coloring of $K_n$ contains either an orderable $K_s$ or a rainbow $K_3$. More generally, for graphs $G$ and $H$, we study $r_2^{\prime }(G)$, the corresponding $2$-color Ramsey number for an orderable $G$, and $CR(G,H)$, where the alternative is a rainbow $H$. For complete bipartite graphs, we prove that for every fixed $s$, $r_2^{\prime }(K_{s,t})=CR(K_{s,t},K_3)=\left(\frac{2^s}{s+1}+o(1)\right)t$ as $t\to \infty$. For $s\in \{2,3\}$, we further determine the exact values of these parameters for infinitely many $t$, using constructions arising from strongly regular graphs, Hadamard matrices and conference matrices.

50 pages. Comments are welcome!