| Localization game for random graphs | 0 | 0.34 | 2022 |
| On The Number Of Alternating Paths In Random Graphs | 0 | 0.34 | 2021 |
| Hat chromatic number of graphs | 0 | 0.34 | 2021 |
| High Powers Of Hamiltonian Cycles In Randomly Augmented Graphs | 0 | 0.34 | 2021 |
| Closing The Random Graph Gap In Tuza'S Conjecture Through The Online Triangle Packing Process | 0 | 0.34 | 2021 |
| Powers of Hamiltonian cycles in randomly augmented graphs | 0 | 0.34 | 2020 |
| Large triangle packings and Tuza's conjecture in sparse random graphs | 0 | 0.34 | 2020 |
| Minimizing The Number Of 5-Cycles In Graphs With Given Edge-Density | 0 | 0.34 | 2020 |
| Monochromatic loose paths in multicolored k-uniform cliques. | 0 | 0.34 | 2019 |
| A note on the localization number of random graphs: Diameter two case | 0 | 0.34 | 2019 |
| Large monochromatic components and long monochromatic cycles in random hypergraphs. | 0 | 0.34 | 2019 |
| On Rainbow Hamilton Cycles in Random Hypergraphs. | 0 | 0.34 | 2018 |
| Constructive Ramsey Numbers for Loose Hyperpaths. | 0 | 0.34 | 2018 |
| On offset Hamilton cycles in random hypergraphs. | 0 | 0.34 | 2018 |
| On the Ramsey-Turán number with small s-independence number. | 0 | 0.34 | 2017 |
| On the size-Ramsey number of hypergraphs | 2 | 0.44 | 2017 |
| On the Number of Alternating Paths in Bipartite Complete Graphs. | 0 | 0.34 | 2017 |
| The vertex size-Ramsey number. | 0 | 0.34 | 2016 |
| Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs | 4 | 0.42 | 2016 |
| Extensions of Results on Rainbow Hamilton Cycles in Uniform Hypergraphs | 1 | 0.40 | 2015 |
| Loose Hamilton Cycles in Regular Hypergraphs. | 1 | 0.36 | 2015 |
| Rainbow Connection of Random Regular Graphs. | 5 | 0.50 | 2015 |
| Approximate Counting of Matchings in $(3, 3)$-Hypergraphs. | 1 | 0.36 | 2014 |
| The t-Tone Chromatic Number of Random Graphs | 1 | 0.40 | 2014 |
| On Generalized Ramsey Numbers for 3-Uniform Hypergraphs | 5 | 0.45 | 2014 |
| On balanced colorings of sparse hypergraphs. | 0 | 0.34 | 2014 |
| Maker-breaker games on random geometric graphs | 1 | 0.36 | 2014 |
| Some recent results on Ramsey-type numbers | 1 | 0.43 | 2013 |
| On Minimum Saturated Matrices | 1 | 0.36 | 2013 |
| Approximate counting of regular hypergraphs | 2 | 0.40 | 2013 |
| Tight Hamilton cycles in random uniform hypergraphs. | 15 | 0.80 | 2013 |
| Cops and robbers on geometric graphs | 4 | 0.47 | 2012 |
| Rainbow Hamilton Cycles in Uniform Hypergraphs. | 1 | 0.37 | 2012 |
| Optimal Divisibility Conditions for Loose Hamilton Cycles in Random Hypergraphs. | 10 | 0.69 | 2012 |
| On the size and structure of graphs with a constant number of 1-factors | 2 | 0.42 | 2012 |
| On induced Folkman numbers | 1 | 0.39 | 2012 |
| Loose Hamilton Cycles in Random Uniform Hypergraphs. | 25 | 1.52 | 2011 |
| Vertex colorings of graphs without short odd cycles | 0 | 0.34 | 2011 |
| On Ks-free subgraphs in Ks+k-free graphs and vertex Folkman numbers. | 0 | 0.34 | 2011 |
| On the maximum number of edges in a hypergraph with a unique perfect matching | 1 | 0.37 | 2011 |
| On the complexity of vertex-coloring edge-weightings. | 10 | 0.87 | 2011 |
| Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence | 1 | 0.35 | 2010 |
| On k-partite hypergraphs with the induced epsilon-density property | 0 | 0.34 | 2010 |
| Flips in Graphs | 1 | 0.63 | 2010 |
| An almost quadratic bound on vertex Folkman numbers | 6 | 0.81 | 2010 |
| On k-chromatically connected graphs | 0 | 0.34 | 2009 |
| A note on universal and canonically coloured sequences | 1 | 0.38 | 2009 |
| On the Folkman Number f(2, 3, 4). | 5 | 0.49 | 2008 |
| New upper bound on vertex Folkman numbers | 2 | 0.53 | 2008 |
| Finding Folkman Numbers via MAX CUT Problem | 1 | 0.36 | 2008 |
