Indexed metadata
Non-isomorphic graphs have distinct vertex-Ramsey classes
Maria Axenovich, Patrick Schmitteckert
Source abstract
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 , Ramsey classes of any non-isomorphic graphs are distinct.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.