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

A Link You Can Just Open
0dev.to
Your coding agent's tests pass. It still edited files you never asked about.
0dev.to OpenSource
FINAL-Bench: VIDRAFT's Daily-Updated Global Weather Model Leaderboard Pits AI Against Traditional NWP on Equal Terms
0dev.to OpenSource
Errpedia: Is Your Exact $k$-NN Vector Search Really Exact?
0arXiv cs.DB
Reconstructing the Probability Measure of a Multi-group Curie-Weiss Model with Interacting Groups
0arXiv stat.TH
Bidirectional Random Projections
0arXiv stat.TH