no. 17 · Wednesday 18 November 2026
Non-isomorphic graphs have distinct vertex-Ramsey classes
Abstract
For a graph $H$, its $k$-colour vertex Ramsey class is the set of all graphs $G$ such that any colouring of the vertices of $G$ in $k$ colours results in a monochromatic (induced) copy of $H$. We prove that for any $k$, the $k$-colour vertex Ramsey classes of any non-isomorphic graphs are distinct. Moreover, we show that this property does not hold when individual graphs are replaced with families of graphs.
- comments
- Added a result on vertex-Ramsey equivalent families of graphs. 5 pages, 1 figure
- fields
- Combinatorics, Information Theory