Open Source
Non-isomorphic graphs have distinct vertex-Ramsey classes
arXiv math.IT0 views
arXiv:2610.03704v2 Announce Type: replace-cross 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.
Source:https://arxiv.org/abs/2610.03704PreviousA depolarizing choir sings in Gaussian harmonyNextOptimal self-orthogonal binary linear codes
Related posts

NASA’s Voyager 1 probe is now one light-day away
0The Verge
Open-source Minecraft launcher. Speed and local
0dev.to GitHub
How to choose where to launch your side project
0dev.to Discuss
Pathology Randomization for Synthetic Priors and Zero-Shot Detection
0arXiv eess.IV

Devin.ai.. Stop Leaving Free Money on the Table: Why Every Developer Must Hammer Devin.ai in This Global 10-Day Window
0dev.to OpenSource
TaF-Foundation: Wrench-Grounded Cross-Sensor Tactile Representations
0arXiv cs.RO