A note on edge-colourings avoiding rainbow \(K_{4}\) and monochromatic \(K_{m}\) (Q2380208)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5686758
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on edge-colourings avoiding rainbow \(K_{4}\) and monochromatic \(K_{m}\) |
scientific article; zbMATH DE number 5686758 |
Statements
A note on edge-colourings avoiding rainbow \(K_{4}\) and monochromatic \(K_{m}\) (English)
0 references
26 March 2010
0 references
Summary: We study the mixed Ramsey number \(\max R(n, K_m, K_r)\), defined as the maximum number of colours in an edge-colouring of the complete graph \(K_n\), such that \(K_n\) has no monochromatic complete subgraph on \(m\) vertices and no rainbow complete subgraph on r vertices. Improving an upper bound of Axenovich and Iverson, we show that \(\max R(n, K_m, K_4) \leq n^{3/2} \sqrt{2m}\) for all \(m \geq 3\). Further, we discuss a possible way to improve their lower bound on \(\max R(n, K_4, K_4)\) based on incidence graphs of finite projective planes.
0 references
mixed Ramsey number
0 references
incidence graphs of finite projective planes
0 references
0.8432596921920776
0 references
0.8269023895263672
0 references
0.7869161367416382
0 references
0.781537652015686
0 references
0.778977632522583
0 references
