On highly ramsey infinite graphs

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

We show that, for r ≥ 2 and k ≥ 3, there exists a positive constant c such that for large enough n there are 2cn2 non-isomorphic graphs on at most n vertices that are r-ramsey-minimal for the odd cycle C 2k+1.

Original languageEnglish
Pages (from-to)97-114
Number of pages18
JournalJournal of Graph Theory
Volume59
Issue number2
DOIs
StatePublished - Oct 2008

Keywords

  • Ramsey-infinite graph
  • Ramsey-minimal graph
  • Signal sender

Fingerprint

Dive into the research topics of 'On highly ramsey infinite graphs'. Together they form a unique fingerprint.

Cite this