On highly ramsey infinite graphs

  • Authors:

  • M. H. Siggers

  • Affiliations:

  • School of Computing Science, Simon Fraser University, Burnaby, BC, Canada V5A 1S6

  • Venue:
  • Journal of Graph Theory
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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 C2k+1. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 97–114, 2008