A note on the monotonicity of mixed Ramsey numbers
From MaRDI portal
Publication:2275461
Abstract: For two graphs, , and , an edge-coloring of a complete graph is -good if there is no monochromatic subgraph isomorphic to and no rainbow subgraph isomorphic to in this coloring. The set of number of colors used by some -colorings of 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 is not a star and does not contain a pendent edge.
Recommendations
Cites work
- scientific article; zbMATH DE number 5717204 (Why is no real title available?)
- scientific article; zbMATH DE number 3494450 (Why is no real title available?)
- Edge colorings of complete graphs without tricolored triangles
- Edge-colored complete graphs with precisely colored subgraphs
- Edge-colorings avoiding rainbow and monochromatic subgraphs
- Extensions of Gallai-Ramsey results
- On colorings avoiding a rainbow cycle and a fixed monochromatic subgraph
- On pattern Ramsey numbers of graphs
- Rainbow numbers for cycles with pendant edges
- Ramsey-type results for Gallai colorings
Cited in
(5)- Gallai-Ramsey numbers for a class of graphs with five vertices
- Gallai-Ramsey numbers of odd cycles and complete bipartite graphs
- scientific article; zbMATH DE number 1563198 (Why is no real title available?)
- On mixed Ramsey numbers
- A chain of normalizers in the Sylow 2-subgroups of the symmetric group on \({\mathbf{2}}^n\) letters
This page was built for publication: A note on the monotonicity of mixed Ramsey numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275461)