2000 character limit reached
A note on monotonicity of mixed Ramsey numbers
Published 14 May 2010 in math.CO | (1005.2629v1)
Abstract: For two graphs, $G$, and $H$, an edge-coloring of a complete graph is $(G,H)$-good if there is no monochromatic subgraph isomorphic to $G$ and no rainbow subgraph isomorphic to $H$ in this coloring. The set of number of colors used by some $(G,H)$-colorings of $K_n$ is called a mixed-Ramsey spectrum. This note addresses a fundamental question of whether the spectrum is an interval. It is shown that the answer is "yes" if $G$ is not a star and $H$ does not contain a pendent edge.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.