2021

Blumenthal, Adam, Lidický, Bernard, Pehova, Yanitsa, Pfende, Florian, Pikhurko, Oleg and Volec, Jan (2021) Sharp bounds for decomposing graphs into edges and triangles. Combinatorics, Probability and Computing, 30 (2). 271 -287. doi:10.1017/S0963548320000358

2020

Kim, Jaehoon, Liu, Hong, Pikhurko, Oleg and Sharifzadeh, Maryam (2020) Asymptotic structure for the Clique Density Theorem. Discrete Analysis . doi:10.19086/da.18559

Grebik, Jan and Pikhurko, Oleg (2020) Measurable versions of Vizing's theorem. Advances in Mathematics, 374 . 107378. doi:10.1016/j.aim.2020.107378

Kang, Mihyun, Makai, Tamás and Pikhurko, Oleg (2020) Supersaturation problem for the bowtie. European Journal of Combinatorics, 88 . 103107. doi:10.1016/j.ejc.2020.103107

Banakh, Taras, Idzik, Adam, Pikhurko, Oleg, Protasov, Igor and Pszczola, Krzysztof (2020) Isometric copies of directed trees in orientations of graphs. Journal of Graph Theory, 94 (2). pp. 175-191. doi:10.1002/jgt.22513

Liu, Hong, Pikhurko, Oleg and Staden, Katherine (2020) The exact minimum number of triangles in graphs with given order and size. Forum of Mathematics, Pi, 8 . e8. doi:10.1017/fmp.2020.7

Grabowski, Lukasz, Máthé, András and Pikhurko, Oleg (2020) Measurable equidecompositions for group actions with an expansion property. Journal of the European Mathematical Society . (In Press)

2019

Liu, Hong, Pikhurko, Oleg and Sharifzadeh, Maryam (2019) Edges not in any monochromatic copy of a fixed graph. Journal of Combinatorial Theory, Series B, 135 . pp. 16-43. doi:10.1016/j.jctb.2018.07.007

Pikhurko, Oleg, Sliačan, Jakub and Tyros, Konstantinos (2019) Strong forms of stability from flag algebra calculations. Journal of Combinatorial Theory Series B, 135 . pp. 129-178. doi:10.1016/j.jctb.2018.08.001

Chervak, Ostap, Pikhurko, Oleg and Staden, Katherine (2019) Minimum number of additive tuples in groups of prime order. The Electronic Journal of Combinatorics, 26 (1).

2018

Naves, Humberto, Pikhurko, Oleg and Scott, Alex (2018) How unproportional must a graph be? European Journal of Combinatorics, 73 . pp. 138-152. doi:10.1016/j.ejc.2018.05.007

Naves, Humberto, Pikhurko, Oleg and Scott, Alex (2018) How unproportional must a graph be? European Journal of Combinatorics, 73 . pp. 138-152. doi:10.1016/j.ejc.2018.05.007

2017

Pikhurko, Oleg, Staden, Katherine and Yilma, Zelealem B. (2017) The Erdos-Rothschild problem on edge-colourings with forbidden monochromatic cliques. Mathematical Proceedings of the Cambridge Philosophical Society, 163 (2). pp. 341-356. doi:10.1017/S0305004116001031

Grabowski, Lukasz, Máthé, András and Pikhurko, Oleg (2017) Measurable circle squaring. Annals of Mathematics, 185 (2). pp. 671-710. doi:10.4007/annals.2017.185.2.6

Pikhurko, Oleg and Yilma, Zelealem B. (2017) Supersaturation problem for color-critical graphs. Journal of Combinatorial Theory, Series B, 123 . pp. 148-185. doi:10.1016/j.jctb.2016.12.001

Pikhurko, Oleg and Razborov, Alexander (2017) Asymptotic structure of graphs with the minimum number of triangles. Combinatorics, Probability and Computing, 26 (1). pp. 138-160. doi:10.1017/S0963548316000110

2016

Csoka, Endre, Lippner, Gabor and Pikhurko, Oleg (2016) Kőnig's Line Coloring and Vizing's Theorems for Graphings. Forum of Mathematics, Sigma, 4 . e27. doi:10.1017/fms.2016.22

DeCorte, E. and Pikhurko, Oleg (2016) Spherical sets avoiding a prescribed set of angles. International Mathematics Research Notices, 2016 (20). pp. 6095-6117. doi:10.1093/imrn/rnv319

2015

Liu, Henry, Pikhurko, Oleg and Sousa, Teresa (2015) Monochromatic clique decompositions of graphs. Journal of Graph Theory, 80 (4). pp. 287-298. doi:10.1002/jgt.21851

Falgas-Ravry, Victor, Marchant, Edward, Pikhurko, Oleg and Vaughan, Emil R. (2015) The codegree threshold for 3-graphs with independent neighborhoods. SIAM Journal on Discrete Mathematics, 29 (3). pp. 1504-1539. doi:10.1137/130926997

Balogh, József, Hu, Ping, Lidicky, Bernard, Pikhurko, Oleg, Udvari, Balázs and Volec, Jan (2015) Minimum number of monotone subsequences of length 4 in permutations. Combinatorics, Probability and Computing, 24 (4). pp. 658-679. doi:10.1017/S0963548314000820

Hladký, Jan, Máthé, András, Patel, Viresh and Pikhurko, Oleg (2015) Poset limits can be totally ordered. American Mathematical Society. Transactions, 367 (6). pp. 4319-4337. doi:10.1090/S0002-9947-2015-06299-0

Pikhurko, Oleg (2015) The maximal length of a gap between r-graph Turán densities. Electronic Journal of Combinatorics, 22 (4). P4.15.

2014

Heise, C. G., Panagiotou, Konstantinos, Pikhurko, Oleg and Taraz, Anusch (2014) Coloring d-embeddable k-uniform hypergraphs. Discrete & Computational Geometry, 52 (4). pp. 663-679. doi:10.1007/s00454-014-9641-2

Cooper, Alec S., Pikhurko, Oleg, Schmitt, John R. and Warrington, Gregory S. (2014) Martin Gardner’s minimum No-3-in-a-line problem. The American Mathematical Monthly, 121 (3). pp. 213-221. doi:10.4169/amer.math.monthly.121.03.213

Pikhurko, Oleg (2014) On possible Turan densities. Israel Journal of Mathematics . doi:10.1007/s11856-014-0031-5

Litwack, K, Pikhurko, Oleg and Pongnumkul, S (2014) How to play Dundee. Australasian Journal of Combinatorics, 115 . pp. 63-88.

2013

Pikhurko, Oleg and Vaughan, Emil (2013) Minimum number of k-Cliques in graphs with bounded independence number. Combinatorics, Probability and Computing, Volume 22 (Number 6). pp. 910-934. doi:10.1017/S0963548313000357

Dudek, Andrzej, Pikhurko, Oleg and Thomason, Andrew (2013) On minimum saturated matrices. Graphs and Combinatorics, Volume 29 (Number 5). pp. 1269-1286. doi:10.1007/s00373-012-1199-2

Král’, Daniel and Pikhurko, Oleg (2013) Quasirandom permutations are characterized by 4-point densities. Geometric and Functional Analysis, Volume 23 (Number 2). pp. 570-579. doi:10.1007/s00039-013-0216-9

Pikhurko, Oleg (2013) Exact computation of the hypergraph Turán function for expanded complete 2-graphs. Journal of Combinatorial Theory, Series B, Volume 103 (Number 2). pp. 220-225. doi:10.1016/j.jctb.2012.09.005

2012

Pikhurko, Oleg and Yilma, Z. B. (2012) The maximum number of K3-free and K4-free edge 4-colorings. Journal of the London Mathematical Society, Vol.83 (No.3). pp. 593-615. doi:10.1112/jlms/jdr031

Pikhurko, Oleg (2012) A note on the Turán function of even cycles. Proceedings of the American Mathematical Society, Vol.140 (No.11). pp. 3687-3692. doi:10.1090/S0002-9939-2012-11274-2

2011

Pikhurko, Oleg (2011) The minimum size of 3-graphs without a 4-set spanning no or exactly three edges. European Journal of Combinatorics, Vol.32 (No.7). pp. 1142-1155. doi:10.1016/j.ejc.2011.03.006

Kang, Minkyung, Pikhurko, Oleg, Ravsky, A., Schacht, M. and Verbitsky, O. (2011) Untangling planar graphs from a specified vertex position — hard cases. Discrete Applied Mathematics, Vol.159 (No.8). pp. 789-799. doi:10.1016/j.dam.2011.01.011

Pikhurko, Oleg and Verbitsky, O. (2011) Logical complexity of graphs : a survey. In: Grohe, Martin and Makowsky, Johann A., (eds.) Model theoretic methods in finite combinatorics : AMS-ASL joint special session, January 5-8, 2009, Washington, DC. Contemporary mathematics, Vol.558 . Providence, R.I.: American Mathematical Society, pp. 129-180. ISBN 9780821849439

Haxell, Penny, Pikhurko, Oleg and Taraz, Anusch (2011) Primality of trees. Journal of Combinatorics, Vol.2 (No.4). pp. 481-500.

Bohman, Tom, Fonoberova, Maria and Pikhurko, Oleg (2011) The saturation function of complete partite graphs. Journal of Combinatorics, Vol.1 (No.2). pp. 149-170. doi:10.1137/090751530

2010

Pikhurko, Oleg (2010) An analytic approach to stability. Discrete Mathematics, Vol.310 (No.21). pp. 2951-2964. doi:10.1016/j.disc.2010.07.002

Loh, P.-S., Pikhurko, Oleg and Sudakov, B. (2010) Maximizing the number of q-colorings. Proceedings of the London Mathematical Society, Vol.101 (No.3). pp. 655-696. doi:10.1112/plms/pdp041

Bohman, Tom, Frieze, Alan, Pikhurko, Oleg and Smyth, Cliff (2010) Anti-Ramsey properties of random graphs. Journal of Combinatorial Theory, Series B, Vol.100 (No.3). pp. 299-312. doi:10.1016/j.jctb.2009.09.002

Bohman, Tom, Frieze, Alan, Mubayi, Dhruv and Pikhurko, Oleg (2010) Hypergraphs with independent neighborhoods. Combinatorica, Vol.30 (No.3). pp. 277-293. doi:10.1007/s00493-010-2474-6

Pikhurko, Oleg (2010) Finding an unknown acyclic orientation of a given graph. Combinatorics, Probability and Computing, Vol.19 (No.1). pp. 121-131. doi:10.1017/S0963548309990289

Bohman, Tom, Dudek, Andrzej, Frieze, Alan and Pikhurko, Oleg (2010) Flips in graphs. SIAM Journal on Discrete Mathematics, Vol.24 (No.3). pp. 1046-1055. doi:10.1137/090752237

Jiang, Tao, Pikhurko, Oleg and Yilma, Zelealem (2010) Set systems without a strong simplex. SIAM Journal on Discrete Mathematics, Vol.24 (No.3). pp. 1038-1045. doi:10.1137/090760775

2009

Jiang, Tao and Pikhurko, Oleg (2009) Anti-Ramsey numbers of doubly edge-critical graphs. Journal of Graph Theory, Vol.61 (No.3). pp. 210-218. doi:10.1002/jgt.20380

Pikhurko, Oleg and Verstraëte, Jacques (2009) The maximum size of hypergraphs without generalized 4-cycles. Journal of Combinatorial Theory, Series A, Vol.116 (No.3). pp. 637-649. doi:10.1016/j.jcta.2008.09.002

Beveridge, Andrew, Bohman, Tom, Frieze, Alan and Pikhurko, Oleg (2009) Memoryless rules for achlioptas processes. SIAM Journal on Discrete Mathematics, Vol.23 (No.2). pp. 993-1008. doi:10.1137/070684148

2008

Füredi, Zoltan, Mubayi, Dhruv and Pikhurko, Oleg (2008) Quadruple systems with independent neighborhoods. Journal of Combinatorial Theory, Series A, Vol.115 (No.8). pp. 1552-1560. doi:10.1016/j.jcta.2008.01.008

Bednarska, Małgorzata and Pikhurko, Oleg (2008) Odd and even cycles in Maker–Breaker games. European Journal of Combinatorics, Vol.29 (No.3). pp. 742-745. doi:10.1016/j.ejc.2007.02.017

Pikhurko, Oleg (2008) An exact Turán result for the generalized triangle. Combinatorica, Vol.28 (No.2). pp. 187-208. doi:10.1007/s00493-008-2187-2

Haxell, Penny, Pikhurko, Oleg and Thomason, Andrew (2008) Maximum acyclic and fragmented sets in regular graphs. Journal of Graph Theory, Vol.57 (No.2). pp. 149-156. doi:10.1002/jgt.20271

Mubayi, Dhruv and Pikhurko, Oleg (2008) Constructions of non-principal families in extremal hypergraph theory. Discrete Mathematics, Vol.308 (No.19). pp. 4430-4434. doi:10.1016/j.disc.2007.08.040

Beveridge, Andrew, Bohman, Tom, Frieze, Alan and Pikhurko, Oleg (2008) Game chromatic index of graphs with given restrictions on degrees. Theoretical Computer Science, Vol.407 (No.1-3). pp. 242-249. doi:10.1016/j.tcs.2008.05.026

Beveridge, Andrew and Pikhurko, Oleg (2008) On the connectivity of extremal Ramsey graphs. Australasian Journal of Combinatorics, Vol.41 . pp. 57-61.

Pikhurko, Oleg (2008) Perfect matchings and K 4 3 -Tilings in hypergraphs of large codegree. Graphs and Combinatorics, Vol.24 (No.4). pp. 391-404. doi:10.1007/s00373-008-0787-7