Name
Abstract | ||
|---|---|---|
Let F be the family of all graphs of maximum degree k + l which can be red-blue edge colored with each of its vertices incident to at most k red edges and at most l blue edges. Let m(k,l) be the maximum number such that every graph with at most m(k,l) vertices of maximum degree k + l is in F. This paper determines m(k,l) except when one of k and l is odd and the other even, in which case best known bounds are given. These values of m(k,l) are used to determine the size Ramsey number r(F1,F2) for many pairs (F1,F2) of star forests, which gives a partial solution to a conjecture of Burr et al. (Proceedings of the Koninklijke Nederlandse Academie van Wetenschappen, Series A, Vol. 81(2), 1978, p. 187.) made in 1978. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0012-365X(01)00238-2 | Discrete Mathematics |
Keywords | Field | DocType |
size ramsey number,bounded degree,series a,partial solution,k red edge,l blue edge,koninklijke nederlandse academie van,vertices incident,two-edge colorings,maximum number,maximum degree k,red-blue edge,ramsey number,maximum degree,edge coloring | Graph theory,Discrete mathematics,Graph,Combinatorics,Colored,Vertex (geometry),Ramsey's theorem,Degree (graph theory),Conjecture,Mathematics,Bounded function | Journal |
Volume | Issue | ISSN |
249 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ervin Györi | 1 | 88 | 21.62 |
| Richard H. Schelp | 2 | 274 | 61.72 |