skip to main content


Search for: All records

Award ID contains: 2154082

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. Free, publicly-accessible full text available March 31, 2025
  2. We determine the maximum possible number of edges of a graph with n vertices, matching number at most s and clique number at most k for all admissible values of the parameters. 
    more » « less
    Free, publicly-accessible full text available March 1, 2025
  3. Free, publicly-accessible full text available February 1, 2025
  4. Free, publicly-accessible full text available January 1, 2025
  5. We present some problems and results about variants of sunflowers in families of sets. In particular, we improve an upper bound of the first author, Körner and Monti on the maximum number of binary vectors of length n so that every four of them are split into two pairs by some coordinate. We also propose a weaker version of the Erdős-Rado sunflower conjecture. 
    more » « less