Mixed Ramsey Numbers Revisited
-
Published:2003-11
Issue:5-6
Volume:12
Page:653-660
-
ISSN:0963-5483
-
Container-title:Combinatorics, Probability and Computing
-
language:en
-
Short-container-title:Combinator. Probab. Comp.
Author:
Rousseau C. C.,Speed S. E.
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.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Irredundance;Developments in Mathematics;2020-09-15