| Sharp bounds for decomposing graphs into edges and triangles | 0 | 0.34 | 2021 |
| Isometric copies of directed trees in orientations of graphs | 0 | 0.34 | 2020 |
| Minimizing The Number Of 5-Cycles In Graphs With Given Edge-Density | 0 | 0.34 | 2020 |
| Supersaturation problem for the bowtie | 0 | 0.34 | 2020 |
| Edges not in any monochromatic copy of a fixed graph. | 0 | 0.34 | 2019 |
| Strong forms of stability from flag algebra calculations. | 0 | 0.34 | 2019 |
| How unproportional must a graph be | 0 | 0.34 | 2018 |
| The minimum number of triangles in graphs of given order and size. | 0 | 0.34 | 2017 |
| Asymptotic Structure of Graphs with the Minimum Number of Triangles | 11 | 0.87 | 2017 |
| Supersaturation Problem for the Bowtie. | 0 | 0.34 | 2017 |
| Supersaturation problem for color-critical graphs | 4 | 0.50 | 2017 |
| The codegree threshold of K4− | 1 | 0.35 | 2017 |
| The Codegree Threshold for 3-Graphs with Independent Neighborhoods | 0 | 0.34 | 2015 |
| Minimum Number of Monotone Subsequences of Length 4 in Permutations. | 10 | 0.76 | 2015 |
| Monochromatic Clique Decompositions of Graphs | 1 | 0.38 | 2015 |
| The Maximal Length of a Gap between r-Graph Turán Densities. | 1 | 0.36 | 2015 |
| Martin Gardner's Minimum No-3-in-a-Line Problem. | 0 | 0.34 | 2014 |
| How to Play Dundee | 0 | 0.34 | 2014 |
| Coloring d-Embeddable k-Uniform Hypergraphs. | 1 | 0.36 | 2014 |
| Minimum Number of k-Cliques in Graphs with Bounded Independence Number. | 7 | 0.60 | 2013 |
| Exact computation of the hypergraph Turán function for expanded complete 2-graphs | 14 | 0.83 | 2013 |
| On Minimum Saturated Matrices | 1 | 0.36 | 2013 |
| The maximum number of K3-free and K4-free edge 4-colorings. | 11 | 1.05 | 2012 |
| The minimum size of 3-graphs without a 4-set spanning no or exactly three edges | 8 | 0.99 | 2011 |
| Set Systems without a Strong Simplex | 4 | 0.55 | 2010 |
| Anti-Ramsey properties of random graphs | 3 | 0.42 | 2010 |
| Hypergraphs with independent neighborhoods | 4 | 0.86 | 2010 |
| Flips in Graphs | 1 | 0.63 | 2010 |
| An analytic approach to stability | 10 | 0.81 | 2010 |
| Memoryless Rules for Achlioptas Processes | 2 | 0.43 | 2009 |
| Finding an unknown acyclic orientation of a given graph | 0 | 0.34 | 2009 |
| Anti-Ramsey numbers of doubly edge-critical graphs | 3 | 0.56 | 2009 |
| The maximum size of hypergraphs without generalized 4-cycles | 5 | 0.62 | 2009 |
| An exact Turán result for the generalized triangle | 16 | 1.05 | 2008 |
| Quadruple systems with independent neighborhoods | 8 | 0.65 | 2008 |
| On The Connectivity Of Extremal Ramsey Graphs | 2 | 0.42 | 2008 |
| A note on minimum K2;3-saturated graphs | 4 | 0.61 | 2008 |
| Obfuscated Drawings of Planar Graphs | 4 | 0.57 | 2008 |
| Odd and even cycles in Maker-Breaker games | 2 | 0.42 | 2008 |
| Game chromatic index of graphs with given restrictions on degrees | 3 | 0.63 | 2008 |
| Note: Quadruple systems with independent neighborhoods | 5 | 0.51 | 2008 |
| Constructions of non-principal families in extremal hypergraph theory | 5 | 0.64 | 2008 |
| Perfect Matchings and K 43-Tilings in Hypergraphs of Large Codegree | 16 | 1.03 | 2008 |
| Maximum acyclic and fragmented sets in regular graphs | 6 | 0.54 | 2008 |
| Maximum number of colorings of (2k, k2)-graphs | 2 | 0.47 | 2007 |
| A new generalization of Mantel's theorem to k-graphs | 14 | 0.91 | 2007 |
| Trees are almost prime | 0 | 0.34 | 2007 |
| Minimum H-decompositions of graphs | 6 | 0.88 | 2007 |
| Decomposable graphs and definitions with no quantifier alternation | 3 | 0.41 | 2007 |
| First-Order Definability of Trees and Sparse Random Graphs | 2 | 0.39 | 2007 |
