|
|||||
|
|
Rainbow decompositions |
|
| Authors: | Raphael Yuster |
| Institution: | Department of Mathematics, University of Haifa, Haifa 31905, Israel |
| Abstract: | A rainbow coloring of a graph is a coloring of the edges with distinct colors. We prove the following extension of Wilson's Theorem. For every integer  there exists an  so that for all  , if   contains  pairwise edge-disjoint rainbow copies of  . Our proof uses, as a main ingredient, a double application of the probabilistic method. |
| Keywords: | |
| 点击此处可从《Proceedings of the American Mathematical Society》浏览原始摘要信息 | |
| 点击此处可从《Proceedings of the American Mathematical Society》下载免费的PDF全文 | |