Pikhurko, Oleg (2014) On possible Turan densities. Israel Journal of Mathematics . ISSN 0021-2172

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. ISSN 0963-5483

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. ISSN 1016-443X

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. ISSN 0095-8956

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. ISSN 0024-6107

Dudek, Andrzej, Pikhurko, Oleg and Thomason, Andrew. (2012) On minimum saturated matrices. Graphs and Combinatorics . ISSN 0911-0119

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. ISSN 0002-9939

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. ISSN 0195-6698

Kang, M., 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. ISSN 0166-218X

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. ISSN 2156-3527

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. ISSN 1942-5600

Pikhurko, Oleg. (2010) An analytic approach to stability. Discrete Mathematics, Vol.310 (No.21). pp. 2951-2964. ISSN 0012-365X

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. ISSN 0024-6115

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. ISSN 0095-8956

Bohman, Tom, Frieze, Alan, Mubayi, Dhruv and Pikhurko, Oleg. (2010) Hypergraphs with independent neighborhoods. Combinatorica, Vol.30 (No.3). pp. 277-293. ISSN 0209-9683

Pikhurko, Oleg. (2010) Finding an unknown acyclic orientation of a given graph. Combinatorics, Probability and Computing, Vol.19 (No.1). pp. 121-131. ISSN 0963-5483

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. ISSN 0895-4801

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. ISSN 0895-4801

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. ISSN 0364-9024

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. ISSN 0097-3165

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. ISSN 0895-4801

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. ISSN 0097-3165

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. ISSN 0195-6698

Pikhurko, Oleg. (2008) An exact Turán result for the generalized triangle. Combinatorica, Vol.28 (No.2). pp. 187-208. ISSN 0209-9683

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. ISSN 0364-9024

Mubayi, Dhruv and Pikhurko, Oleg. (2008) Constructions of non-principal families in extremal hypergraph theory. Discrete Mathematics, Vol.308 (No.19). pp. 4430-4434. ISSN 0012-365X

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. ISSN 0304-3975

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

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. ISSN 0911-0119

Pikhurko, Oleg and Yilma, Z. B. Supersaturation problem for color-critical graphs.

Pikhurko, Oleg and Schmitt, John. A note on minimum K2,3-saturated graphs. Australasian Journal of Combinatorics, Vol.40 . pp. 211-215. ISSN 1034-4942