Finding a monochromatic subgraph or a ra
β
AndrΓ‘s GyΓ‘rfΓ‘s; JenΕ Lehel; Richard H. Schelp
π
Article
π
2006
π
John Wiley and Sons
π
English
β 144 KB
## Abstract For simple graphs __G__ and __H__, let __f__(__G__,__H__) denote the least integer __N__ such that every coloring of the edges of __K__~__N__~ contains either a monochromatic copy of __G__ or a rainbow copy of __H__. Here we investigate __f__(__G__,__H__) when __H__β=β__P__~__k__~. We s