Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Rainbow Decompositions

Raphael Yuster
Proceedings of the American Mathematical Society
Vol. 136, No. 3 (Mar., 2008), pp. 771-779
Stable URL: http://www.jstor.org/stable/20535235
Page Count: 9
  • Read Online (Free)
  • Download ($30.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Rainbow Decompositions
Preview not available

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 k there exists an n₀ = n₀(k) so that for all n > n₀, if n mod k(k - 1) ∈ {1, k}, then every properly edge-colored $K_{n}$ contains $\left(\underset 2\to{n}\right)\diagup \left(\underset 2\to{k}\right)$ pairwise edge-disjoint rainbow copies of $K_{k}$. Our proof uses, as a main ingredient, a double application of the probabilistic method.

Page Thumbnails

  • Thumbnail: Page 
771
    771
  • Thumbnail: Page 
772
    772
  • Thumbnail: Page 
773
    773
  • Thumbnail: Page 
774
    774
  • Thumbnail: Page 
775
    775
  • Thumbnail: Page 
776
    776
  • Thumbnail: Page 
777
    777
  • Thumbnail: Page 
778
    778
  • Thumbnail: Page 
779
    779