Local and Mean Ramsey Numbers for Some Graphs
โ Scribed by Halina Bielak
- Book ID
- 104444285
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 213 KB
- Volume
- 10
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this note we find the local and mean k-Ramsey numbers for many trees for which the Erdo s So s tree conjecture holds. ## 2000 Academic Press The usual Ramsey number R(G, k) is the smallest positive integer n such that any coloring of the edges of K n by at most k colors contains a monochromatic
This paper establishes that the local k-Ramsey number R(K m , k -loc) is identical with the mean k-Ramsey number R(K m , k -mean). This answers part of a question raised by Caro and Tuza.
We consider a class of graphs on n vertices, called (d,f)-arrangeable graphs. This class of graphs contains all graphs of bounded degree d, and all df-arrangeable graphs, a class introduced by Chen and Schelp in 1993. In 1992, a variation of the Regularity Lemma of Szemer6di was introduced by Eaton
Let p(G) denote the smallest number of vertices in a maximal clique of the graph G, while i(G) (the independent domination number of G) denotes the smallest number of vertices in a maximal independent (i.e. independent dominating) set of G. For given integers 1 and m, the lower Ramsey number s(l, m)