skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Turetsky, Dan"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; ; (, Israel Journal of Mathematics)
    Full Text Available 
  2. ; ; ; ; (, Israel journal of mathematics)
    Fix an r-coloring of the pairs of natural numbers. An ordered list of distinct integers, is a monochromatic path for color k, if every two adjacent integers in the list have the same color. A path decomposition for the coloring is a collection of r paths P0,P1,...,Pr−1 such that Pj is a path of color j and every integer appears on exactly one path. Improving on an unpublished result of Erdos, Rado published a theorem which implies: Every r- coloring of the pairs of natural numbers has a path decomposition. We analyse the effective content of this theorem. 
    more » « less
    Accepted Manuscript Full Text Available