Hostname: page-component-7dd5485656-hw7sx Total loading time: 0 Render date: 2025-10-28T11:18:41.519Z Has data issue: false hasContentIssue false
  • English
  • Français

Mixed Ramsey Numbers Revisited

Published online by Cambridge University Press:  03 December 2003

C. C. Rousseau  and
S. E. Speed
C. C. Rousseau*
Affiliation:
Department of Mathematical Sciences, The University of Memphis, 373 Dunn Hall, Memphis, Tennessee 38152-3240, USA
S. E. Speed*
Affiliation:
Department of Mathematical Sciences, The University of Memphis, 373 Dunn Hall, Memphis, Tennessee 38152-3240, USA
*
(e-mail: ccrousse@memphis.edu)
(e-mail: samspeed@memphis.edu)
Get access Rights & Permissions [Opens in a new window]

Abstract

Given a graph Hwith no isolates, the (generalized) mixed Ramsey number is the smallest integer r such that every H-free graph of order r contains an m-element irredundant set. We consider some questions concerning the asymptotic behaviour of this number (i) with H fixed and , (ii) with m fixed and a sequence of dense graphs, in particular for the sequence . Open problems are mentioned throughout the paper.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 12 , Issue 5-6: This issue contains volume twelve, parts five and six , November 2003 , pp. 653 - 660
Copyright
Copyright © Cambridge University Press 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable