Rainbow Arithmetic Progressions and Anti-Ramsey Results
Combinatorics, Probability and Computing
Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints
Random Structures & Algorithms
An Upper Bound for Constrained Ramsey Numbers
Combinatorics, Probability and Computing
Mono-multi bipartite Ramsey numbers, designs, and matrices
Journal of Combinatorial Theory Series A
Combinatorics, Probability and Computing
Combinatorics, Probability and Computing
Sufficient conditions for the existence of perfect heterochromatic matchings in colored graphs
CJCDGCGT'05 Proceedings of the 7th China-Japan conference on Discrete geometry, combinatorics and graph theory
Orientable edge colorings of graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
Given two graphs G and H, let f(G,H) denote the minimum integer n such that in every coloring of the edges of Kn, there is either a copy of G with all edges having the same color or a copy of H with all edges having different colors. We show that f(G,H) is finite iff G is a star or H is acyclic. If S and T are trees with s and t edges, respectively, we show that 1+s(t-2)-2≤f(S,T)≤(s-1)(t2+3t). Using constructions from design theory, we establish the exact values, lying near (s-1)(t-1), for f(S,T) when S and T are certain paths or star-like trees. © 2002 Wiley Periodicals, Inc. J Graph Theory 42: 1–16, 2003