Oleg Pikhurko
Title
Cited by
Cited by
Year
Perfect Matchings and K 43 -Tilings in Hypergraphs of Large Codegree
O Pikhurko
Graphs and Combinatorics 24 (4), 391-404, 2008
802008
Quasirandom permutations are characterized by 4-point densities
D Král, O Pikhurko
Geometric and Functional Analysis 23 (2), 570-579, 2013
702013
Lattice points in lattice polytopes
O Pikhurko
Mathematika 48 (1-2), 15-24, 2001
582001
Exact computation of the hypergraph Turán function for expanded complete 2-graphs
O Pikhurko
Journal of Combinatorial Theory, Series B 103 (2), 220-225, 2013
562013
A note on the Turán function of even cycles
O Pikhurko
Proceedings of the American Mathematical Society 140 (11), 3687-3692, 2012
562012
Results and open problems on minimum saturated hypergraphs
O Pikhurko
552002
Asymptotic structure of graphs with the minimum number of triangles
O Pikhurko, A Razborov
Combinatorics, Probability and Computing 26 (1), 138-160, 2017
542017
The maximum number of K3‐free and K4‐free edge 4‐colorings
O Pikhurko, ZB Yilma
Journal of the London Mathematical Society 85 (3), 593-615, 2012
512012
On triple systems with independent neighbourhoods
Z Füredi, O Pikhurko, M Simonovits
Combinatorics, Probability and Computing 14 (5-6), 795-813, 2005
512005
An exact Turán result for the generalized triangle
O Pikhurko
Combinatorica 28 (2), 187-208, 2008
502008
Minimum number of k-cliques in graphs with bounded independence number
O Pikhurko, ER Vaughan
Combinatorics, Probability and Computing 22 (6), 910-934, 2013
482013
A new generalization of Mantel's theorem to k-graphs
D Mubayi, O Pikhurko
Journal of Combinatorial Theory, Series B 97 (4), 669-678, 2007
392007
The Turán Density of the Hypergraph $\{abc, ade, bde, cde\} $
Z Füredi, O Pikhurko, M Simonovits
the electronic journal of combinatorics, R18-R18, 2003
392003
Minimum number of monotone subsequences of length 4 in permutations
J Balogh, P Hu, B Lidický, O Pikhurko, B Udvari, J Volec
Combinatorics, Probability and Computing 24 (4), 658-679, 2015
362015
Primality of trees
P Haxell, O Pikhurko, A Taraz
Journal of Combinatorics 2 (4), 481-500, 2011
342011
Maximizing the number of q‐colorings
PS Loh, O Pikhurko, B Sudakov
Proceedings of the London Mathematical Society 101 (3), 655-696, 2010
342010
How complex are random graphs in first order logic?
JH Kim, O Pikhurko, JH Spencer, O Verbitsky
Random Structures & Algorithms 26 (1‐2), 119-145, 2005
332005
The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
O Pikhurko
European Journal of Combinatorics 32 (7), 1142-1155, 2011
302011
Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
C Greenhill, O Pikhurko
Graphs and Combinatorics 21 (4), 407-419, 2005
302005
The minimum size of saturated hypergraphs
O Pikhurko
Combinatorics, Probability and Computing 8 (5), 483-492, 1999
301999
The system can't perform the operation now. Try again later.
Articles 1–20