Oleg Pikhurko
Affiliations: | Carnegie Mellon University, Pittsburgh, PA |
Area:
MathematicsGoogle:
"Oleg Pikhurko"Children
Sign in to add trainee| Teresa M. Sousa | grad student | 2006 | Carnegie Mellon |
| David Offner | grad student | 2009 | Carnegie Mellon |
| Zelealem B. Yilma | grad student | 2011 | Carnegie Mellon |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Bennett P, Dudek A, Lidický B, et al. (2020) Minimizing the number of 5-cycles in graphs with given edge-density Combinatorics, Probability & Computing. 29: 44-67 |
| Liu H, Pikhurko O, Staden K. (2020) The exact minimum number of triangles in graphs with given order and size Forum of Mathematics, Pi. 8 |
| Kang M, Makai T, Pikhurko O. (2020) Supersaturation problem for the bowtie European Journal of Combinatorics. 88: 103107 |
| Grebík J, Pikhurko O. (2020) Measurable versions of Vizing's theorem Advances in Mathematics. 107378 |
| Banakh TO, Idzik A, Pikhurko O, et al. (2020) Isometric copies of directed trees in orientations of graphs Journal of Graph Theory. 94: 175-191 |
| Chervak O, Pikhurko O, Staden K. (2019) Minimum number of additive tuples in groups of prime order Electronic Journal of Combinatorics. 26 |
| Pikhurko O, Sliačan J, Tyros K. (2019) Strong forms of stability from flag algebra calculations Journal of Combinatorial Theory, Series B. 135: 129-178 |
| Liu H, Pikhurko O, Sharifzadeh M. (2019) Edges not in any monochromatic copy of a fixed graph Journal of Combinatorial Theory, Series B. 135: 16-43 |
| Naves H, Pikhurko O, Scott A. (2018) How unproportional must a graph be European Journal of Combinatorics. 73: 138-152 |
| Grabowski Ł, Máthé A, Pikhurko O. (2017) Measurable circle squaring Annals of Mathematics. 185: 671-710 |