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: 2152490

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. ; ; (, Journal of Graph Theory)
    ABSTRACT We study extensions of Turán Theorem in edge‐weighted settings. A particular case of interest is when constraints on the weight of an edge come from the order of the largest clique containing it. These problems are motivated by Ramsey‐Turán type problems. Some of our proofs are based on the method of graph Lagrangians, while the other proofs use flag algebras. Using these results, we prove several new upper bounds on the Ramsey‐Turán density of cliques. Other applications of our results are in a recent paper of Balogh, Chen, McCourt, and Murley. 
    more » « less
    Free, publicly-accessible full text available September 1, 2026
  2. ; ; (, Journal of Graph Theory)
    Abstract We determine the maximum number of induced copies of a 5‐cycle in a graph on vertices for every . Every extremal construction is a balanced iterated blow‐up of the 5‐cycle with the possible exception of the smallest level where for , the Möbius ladder achieves the same number of induced 5‐cycles as the blow‐up of a 5‐cycle on eight vertices. This result completes the work of Balogh, Hu, Lidický, and Pfender, who proved an asymptotic version of the result. Similarly to their result, we also use the flag algebra method, but we use a new and more sophisticated approach which allows us to extend its use to small graphs. 
    more » « less
  3. ; ; (, Advances in Combinatorics)
    Free, publicly-accessible full text available May 23, 2026
  4. ; ; ; ; ; ; ; (, Discrete & Computational Geometry)
    Free, publicly-accessible full text available March 1, 2026
  5. ; ; (, Discrete Applied Mathematics)
    Free, publicly-accessible full text available December 1, 2025
  6. ; ; ; ; (, SIAM Journal on Discrete Mathematics)
    Full Text Available 
  7. ; ; ; ; ; (, Procedia Computer Science)
    Full Text Available 
  8. ; ; ; (, Discrete Applied Mathematics)
    Full Text Available