skip to main content

Explore Research Products in the NSF-PAR

  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Krivelevich, Michael"

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. ; ; ( , Discrete Mathematics)
    Full Text Available 
  2. ; ; ( , Journal of Graph Theory)
    Full Text Available 
  3. ; ; ( , Random Structures & Algorithms)
    Abstract

    We show that with high probability the random graph has an induced subgraph of linear size, all of whose degrees are congruent to for any fixed and . More generally, the same is true for any fixed distribution of degrees modulo . Finally, we show that with high probability we can partition the vertices of into parts of nearly equal size, each of which induces a subgraph all of whose degrees are congruent to . Our results resolve affirmatively a conjecture of Scott, who addressed the case .

     
    more » « less
  4. ; ( , Journal of Graph Theory)
  5. ; ; ; ( , Random Structures & Algorithms)
  6. ; ; ; ( , Proceedings of the London Mathematical Society)