Polychromatic Cliques and Related Questions (2003)
by
Tom Bohman
,
Alan Frieze
,
Ryan Martin
,
Miklos Ruszinko
,
Clifford Smyth
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@MISC{Bohman03polychromaticcliques,
author = {Tom Bohman and Alan Frieze and Ryan Martin and Miklos Ruszinko and Clifford Smyth},
title = {Polychromatic Cliques and Related Questions},
year = {2003}
}
author = {Tom Bohman and Alan Frieze and Ryan Martin and Miklos Ruszinko and Clifford Smyth},
title = {Polychromatic Cliques and Related Questions},
year = {2003}
}
Bookmarks
OpenURL
Abstract:
Let the edges of a graph G be coloured so that no colour is used more than k times. We refer to this as a k-bounded colouring. We say that a subset of the edges of G is polychromatic if each edge is of a different colour. In this paper we address the problem of finding the minimum number m such that every k-bounded colouring of Km contains a polychromatic copy of K n . We then generalise this to some related problems.
Citations
| 16 | Path and cycle sub-Ramsey numbers and an edgecolouring conjecture, Discrete Mathematics 62 – Hahn, Thomassen - 1986 |
| 11 | Multicoloured Hamilton cycles – Albert, Frieze, et al. - 1995 |
| 10 | Some problems related to partitions of edges of a graph – Erdős, Nesetril, et al. - 1983 |
| 4 | On sub-Ramsey numbers, Ars Combinatoria 22 – Alspach, Gerson, et al. - 1986 |
| 3 | Multi-coloured Hamilton cycles in randomly coloured random graphs,Combinatorics, Probability and Computing 11 (2002) 129-134. [5 – Cooper, Frieze - 1983 |
| 3 | A.M.Frieze, On the existence of polychromatic sets of edges in graphs and digraphs – Fenner - 1984 |
| 3 | sub-Ramsey numbers – Fraisse, Hahn, et al. - 1987 |
| 3 | Some star anti-Ramsey numbers, Congressus Num – Hahn - 1977 |
| 2 | More star anti-Ramsey numbers, Discrete Mathematics 43 – Hahn - 1981 |
| 1 | Polychromatic cliques, ITI – Hell, Montellano |
