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

Award ID contains: 1502650

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. ; (, Random Structures & Algorithms)
    A 1992 conjecture of Alon and Spencer says, roughly, that the ordinary random graphGn,1/2typically admits a covering of a constant fraction of its edges by edge‐disjoint, nearly maximum cliques. We show that this is not the case. The disproof is based on some (partial) understanding of a more basic question: forandA1,…,Atchosen uniformly and independently from thek‐subsets of {1,…,n}, what can one say aboutOur main concern is trying to understand how closely the answers to this and a related question about matchings follow heuristics gotten by pretending that certain (dependent) choices are made independently. 
    more » « less
  2. ; ; (, Journal of Combinatorial Theory, Series A)
    Full Text Available 
  3. (, Discrete Mathematics)
    Full Text Available 
  4. ; (, Journal of Combinatorial Theory, Series B)
    Full Text Available 
  5. ; (, Discrete Mathematics)
    Full Text Available