We report a proof that infinitely many connected graphs have target Ramsey numbers exceeding their ordinary Ramsey numbers, suggesting new insights into graph theory.
We answer an open problem of Chartrand and Zhang concerning target Ramsey numbers. We prove that there exist infinitely many connected graphs whose target Ramsey number is strictly larger than their ordinary Ramsey number. The proof combines an elementary counting lower bound with asymptotic Ramsey results for balanced grid graphs. As a complementary result, we present an independent asymptotic construction based on Ramsey numbers of multiple copies of a fixed graph.
No takes yet. Share an insight, caveat, or question.
Guillaume Lecomte (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: