← 研踪 PaperTrailarXiv:2610.03704 · v2
Non-isomorphic graphs have distinct vertex-Ramsey classes
首次提交 2026-10-03 01:56
版本更新 2026-11-17 21:21
雷达观测 2026-11-18 19:41
摘要
For a graph , its -colour vertex Ramsey class is the set of all graphs such that any colouring of the vertices of in colours results in a monochromatic (induced) copy of . We prove that for any , the -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.
作者备注:Added a result on vertex-Ramsey equivalent families of graphs. 5 pages, 1 figure
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v2 · 2026-11-17 21:21 · 最新观测版本
Non-isomorphic graphs have distinct vertex-Ramsey classes
For a graph , its -colour vertex Ramsey class is the set of all graphs such that any colouring of the vertices of in colours results in a monochromatic (induced) copy of . We prove that for any , the -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.
查看此版本解读 →查看此版本原文 ↗