Induced Ramsey Numbers Overview

• Induced Ramsey numbers are defined as the smallest number of vertices in a graph that guarantee a monochromatic induced copy of a target graph in every two-color edge assignment.
• Recent advances achieve exponential upper bounds using pseudorandom host graphs and balanced embedding techniques, significantly narrowing the gap with classical Ramsey numbers.
• The topic interconnects extremal graph theory, probabilistic methods, and hypergraph approaches, opening practical avenues for refined structural and computational analysis.

The induced Ramsey number $r_{\mathrm{ind}}(H)$ of a graph $H$ is the smallest integer $N$ such that there exists a graph $G$ on $N$ vertices in which every two-coloring of $E(G)$ produces an induced monochromatic copy of $H$. Introduced as a strengthening of the classical Ramsey number, $r_{\mathrm{ind}}(H)$ captures the minimum order of a host graph required to guarantee a monochromatic induced subgraph isomorphic to $H$ in every edge coloring. Induced Ramsey theory appears at the intersection of Ramsey-type phenomena, extremal graph theory, pseudorandomness, and algorithmic embedding methods, with applications across discrete mathematics. This article reviews the foundational definitions, principal results, methods, and current directions in the study of induced Ramsey numbers for graphs.

1. Formal Definitions and Historical Development

For a finite simple graph $H$ on $n$ vertices, the classical Ramsey number $r(H)$ is the smallest $N$ such that every red-blue coloring of $K_N$ contains a monochromatic (not necessarily induced) copy of $H$. The induced Ramsey number $r_{\mathrm{ind}}(H)$ is defined analogously, but requiring a monochromatic induced copy of $H$. That is, for all red–blue colorings of $E(G)$, there is a monochromatic induced subgraph isomorphic to $H$. The existence of $r_{\mathrm{ind}}(H)$ for all $H$ was established in the 1970s by Deuber, Erdős–Hajnal–Pósa, and Rödl via the regularity lemma, but the bounds obtained were of non-elementary (tower-type) magnitude in $n$ (Conlon et al., 2010).

Erdős conjectured that there exists a universal constant $c>0$ such that $r_{\mathrm{ind}}(H) \leq 2^{c n}$ for every graph $H$ on $n$ vertices. While the trivial lower bound $r_{\mathrm{ind}}(K_n)=r(K_n)=2^{\Omega(n)}$ follows from classical Ramsey theory, matching upper bounds have remained elusive for several decades. The best general construction prior to 2010 was due to Kohayakawa, Prömel, and Rödl, showing $r_{\mathrm{ind}}(H)\leq 2^{C n \log n}$ for some $C>0$ (Conlon et al., 2010).

2. State-of-the-Art Upper Bounds

The principal recent advance on Erdős's conjecture is the exponential improvement for all graphs by Conlon, Fox, and Sudakov (Conlon et al., 2010). They construct an explicit host graph $G$ on $N=2^{O(n\log n)}$ vertices having the following property: in every 2-coloring of $E(G)$, every $n$-vertex graph $H$ appears as an induced monochromatic subgraph. This improved earlier $2^{O(n(\log n)^2)}$-type bounds by a logarithmic factor in the exponent.

The construction relies on $(1/2,\lambda)$-pseudorandom graphs, such as Paley graphs $P_N$ with $\lambda=O(\sqrt{N})$, and embedding arguments that exploit the simultaneous control of denseness within partition classes and global sparsity between them. The embedding proceeds by maintaining candidate sets for vertices and leveraging pseudorandomness to prevent the rapid shrinking of these sets. The critical bottleneck in previous arguments—repeated set-shrinkage leading to double-logarithmic exponentials—is avoided by symmetric handling of both edge colors and refined counting. The result brings the upper bound for general $n$-vertex $H$ to $r_{\mathrm{ind}}(H)\leq 2^{O(n\log n)}$ (Conlon et al., 2010).

The exponential lower bound persists for $K_n$, but closing the gap to $2^{O(n)}$ remains the central open question.

3. Probabilistic, Pseudorandom, and Hypergraph Methods

Key advances hinge on new probabilistic and pseudorandom methods:

• Pseudorandom host graphs: Instead of purely random graphs, explicit highly pseudorandom graphs (such as Paley graphs) are used to ensure uniform edge distribution between large subsets. This is crucial for balanced embedding strategies (Conlon et al., 2010).
• Dichotomy approach: The proof exploits a dichotomy between local density (in one color) and global sparsity (of the other color) within a carefully constructed vertex partition. Bootstrapping lemmas grow the partition until all vertices of $H$ can be mapped, controlling both density and independence (Conlon et al., 2010).
• Balanced embedding: For each potential image of $H$ during the embedding, the candidate sets contract only by a bounded factor, preventing the tower-type explosion of required host graph size present in Szemerédi-regularity-type arguments.
• Lower bounds via sharp constructions: For many $H$, the lower bounds are tight up to logarithmic factors; for example, $r_{\mathrm{ind}}(K_n)$ matches classical Ramsey growth.
• Hypergraph extensions: Parallel results for $k$-uniform hypergraphs use the Hypergraph Container Method, yielding upper bounds for the induced Ramsey number $r_{\mathrm{ind}}(F)$ in terms of the classical $r(F)$ (Conlon et al., 2016). For $3$-uniform hypergraphs, $r_{\mathrm{ind}}(F)\leq 2^{2^{ct}}$ for absolute $c>0$ and all $t$.

4. Induced Ramsey Numbers for Classes and Special Families

The behavior of $r_{\mathrm{ind}}(H)$ varies significantly with graph structure:

• Linear and exponential bounds: For graphs of maximum degree $\Delta$, non-induced Ramsey numbers satisfy $r(H)\leq c(\Delta) n$, with $c(\Delta)\leq 2^{c\Delta\log\Delta}$ (Conlon et al., 2010). For induced Ramsey numbers, upper bounds remain only quasi-exponential in $n$ for general graphs.
• Bipartite graphs and bounded complexity: For hereditary classes excluding certain induced subgraphs (forests, unions of cliques, and their complements), Ramsey numbers are linear in $n$. The characterization for such classes relies on forbidden induced subgraphs and has been investigated extensively for finite forbidden sets (Alecu et al., 2019).
• Boolean lattice: For the poset Ramsey number $R(Q_m,Q_n)$ in the Boolean lattice, explicit asymptotics have been obtained for small $m$, settling longstanding questions when $m=2$ (Grósz et al., 2021).

5. Lower Bounds and Extremal Constructions

The best known general lower bound is the classical Ramsey growth for $K_n$-avoidance. There are also sharp lower bounds linking the independence and clique numbers of $G$ and $H$:

• For connected $G$ with independence number $\alpha$ and $H$ with clique number $\omega$, $$r_{\mathrm{ind}}(G,H)\geq (\alpha-1)\binom{\omega}{2}+\omega$$, which is sharp for $(G,H)=(S_k,K_n)$ (Gorgol, 2017).
• For disconnected $G$ (with no isolated vertices), $r_{\mathrm{ind}}(G,H)\geq \alpha \omega$; sharp for $(kK_2,K_n)$ (Gorgol, 2017).

6. Extensions and Open Problems

Major directions and unsolved problems include:

• Erdős’s conjecture: Whether $r_{\mathrm{ind}}(H)\leq 2^{c n}$ holds universally for all $n$-vertex graphs $H$.
• Multi-color variants: Recent advances give $R_{\mathrm{ind}}(H;r)\leq r^{C r k}$, tightening previous bounds for the $r$-color induced Ramsey number to single-exponential in both $k$ and $r$ (Aragão et al., 26 Sep 2025).
• Explicit vs. probabilistic constructions: While almost all random graphs of size $r^{O(rk)}$ have the induced Ramsey property, finding explicit deterministic constructions of such host graphs remains open (Aragão et al., 26 Sep 2025).
• Special graph families: Further progress is anticipated for graphs with restricted structure, such as bounded degeneracy, arrangeability, or additional hereditary properties.
• Hypergraph and infinite-dimensional extensions: Sharp asymptotics for multi-uniform, multi-color induced Ramsey numbers largely remain open at higher uniformities and for infinite families.

7. Significance and Relationship to Broader Ramsey Theory

The improved exponential upper bounds on induced Ramsey numbers mark a substantial narrowing of the gap between what is conjectured and what is provably achievable. The methods circumvent the inherent limitations of regularity-based arguments and unify extremal, probabilistic, and pseudorandom approaches. Induced Ramsey numbers, by imposing the stronger restriction of induced subgraphs, provide a fertile ground for exploring the interplay between local and global structure, random phenomena, and the role of forbidden configurations in large networks. Recent advances have placed fundamental Ramsey-type phenomena for induced substructures within reach of full resolution, with broader implications for extremal combinatorics and theoretical computer science (Conlon et al., 2010, Aragão et al., 26 Sep 2025).