Oleg Pikhurko

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 19

Top Topics

Grow Exponentially

Top Venues

Comb. Probab. Comput.

J. Comb. Theory, Ser. B

Electron. J. Comb.

Electron. Notes Discret. Math.

Publications

Andrzej Grzesik, Daniel Král', Oleg Pikhurko
Forcing generalised quasirandom graphs efficiently. Comb. Probab. Comput. 33 (1) (2024)
Irene Gil Fernández, Joseph Hyde, Hong Liu, Oleg Pikhurko, Zhuo Wu
Disjoint isomorphic balanced clique subdivisions. J. Comb. Theory, Ser. B 161 (2023)
Oleg Pikhurko
On the Limit of the Positive $\ell$-Degree Turán Problem. Electron. J. Comb. 30 (3) (2023)
Xizhi Liu, Oleg Pikhurko
Hypergraph Turán densities can have arbitrarily large algebraic degree. J. Comb. Theory, Ser. B 161 (2023)
Endre Csóka, Lukasz Grabowski, András Máthé, Oleg Pikhurko, Konstantinos Tyros
Moser-Tardos Algorithm with small number of random bits. CoRR (2022)
Adam Blumenthal, Bernard Lidický, Yanitsa Pehova, Florian Pfender, Oleg Pikhurko, Jan Volec
Sharp bounds for decomposing graphs into edges and triangles. Comb. Probab. Comput. 30 (2) (2021)
Oleg Pikhurko
Borel combinatorics of locally finite graphs. BCC (2021)
Patrick Bennett, Andrzej Dudek, Bernard Lidický, Oleg Pikhurko
Minimizing the number of 5-cycles in graphs with given edge-density. Comb. Probab. Comput. 29 (1) (2020)
Taras O. Banakh, Adam Idzik, Oleg Pikhurko, Igor Protasov, Krzysztof Pszczola
Isometric copies of directed trees in orientations of graphs. J. Graph Theory 94 (2) (2020)
Mihyun Kang, Tamás Makai, Oleg Pikhurko
Supersaturation problem for the bowtie. Eur. J. Comb. 88 (2020)
Ostap Chervak, Oleg Pikhurko, Katherine Staden
Minimum Number of Additive Tuples in Groups of Prime Order. Electron. J. Comb. 26 (1) (2019)
Hong Liu, Oleg Pikhurko, Maryam Sharifzadeh
Edges not in any monochromatic copy of a fixed graph. J. Comb. Theory, Ser. B 135 (2019)
Oleg Pikhurko, Jakub Sliacan, Konstantinos Tyros
Strong forms of stability from flag algebra calculations. J. Comb. Theory, Ser. B 135 (2019)
Humberto Naves, Oleg Pikhurko, Alex Scott
How unproportional must a graph be? Eur. J. Comb. 73 (2018)
Mihyun Kang, Tamás Makai, Oleg Pikhurko
Supersaturation Problem for the Bowtie. Electron. Notes Discret. Math. 61 (2017)
Oleg Pikhurko, Alexander A. Razborov
Asymptotic Structure of Graphs with the Minimum Number of Triangles. Comb. Probab. Comput. 26 (1) (2017)
Oleg Pikhurko, Zelealem B. Yilma
Supersaturation problem for color-critical graphs. J. Comb. Theory, Ser. B 123 (2017)
Hong Liu, Oleg Pikhurko, Katherine Staden
The minimum number of triangles in graphs of given order and size. Electron. Notes Discret. Math. 61 (2017)
Victor Falgas-Ravry, Oleg Pikhurko, Emil R. Vaughan, Jan Volec
. Electron. Notes Discret. Math. 61 (2017)
József Balogh, Ping Hu, Bernard Lidický, Oleg Pikhurko, Balázs Udvari, Jan Volec
Minimum Number of Monotone Subsequences of Length 4 in Permutations. Comb. Probab. Comput. 24 (4) (2015)
Henry Liu, Oleg Pikhurko, Teresa Sousa
Monochromatic Clique Decompositions of Graphs. J. Graph Theory 80 (4) (2015)
Oleg Pikhurko
The Maximal Length of a Gap between r-Graph Turán Densities. Electron. J. Comb. 22 (4) (2015)
Victor Falgas-Ravry, Edward Marchant, Oleg Pikhurko, Emil R. Vaughan
The Codegree Threshold for 3-Graphs with Independent Neighborhoods. SIAM J. Discret. Math. 29 (3) (2015)
Kevin Litwack, Oleg Pikhurko, Suporn Pongnumkul
How to Play Dundee. Ars Comb. 115 (2014)
Carl Georg Heise, Konstantinos Panagiotou, Oleg Pikhurko, Anusch Taraz
Coloring d-Embeddable k-Uniform Hypergraphs. Discret. Comput. Geom. 52 (4) (2014)
Alec S. Cooper, Oleg Pikhurko, John R. Schmitt, Gregory S. Warrington
Martin Gardner's Minimum No-3-in-a-Line Problem. Am. Math. Mon. 121 (3) (2014)
Oleg Pikhurko, Emil R. Vaughan
-Cliques in Graphs with Bounded Independence Number. Comb. Probab. Comput. 22 (6) (2013)
Andrzej Dudek, Oleg Pikhurko, Andrew Thomason
On Minimum Saturated Matrices. Graphs Comb. 29 (5) (2013)
Oleg Pikhurko
Exact computation of the hypergraph Turán function for expanded complete 2-graphs. J. Comb. Theory, Ser. B 103 (2) (2013)
Oleg Pikhurko, Zelealem B. Yilma
-free edge 4-colorings. J. Lond. Math. Soc. 85 (3) (2012)
Oleg Pikhurko
The minimum size of 3-graphs without a 4-set spanning no or exactly three edges. Eur. J. Comb. 32 (7) (2011)
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky
Untangling planar graphs from a specified vertex position - Hard cases. Discret. Appl. Math. 159 (8) (2011)
Oleg Pikhurko
Finding an Unknown Acyclic Orientation of a Given Graph. Comb. Probab. Comput. 19 (1) (2010)
Oleg Pikhurko
An analytic approach to stability. Discret. Math. 310 (21) (2010)
Tao Jiang, Oleg Pikhurko, Zelealem B. Yilma
Set Systems without a Strong Simplex. SIAM J. Discret. Math. 24 (3) (2010)
Tom Bohman, Alan M. Frieze, Dhruv Mubayi, Oleg Pikhurko
Hypergraphs with independent neighborhoods. Comb. 30 (3) (2010)
Oleg Pikhurko, Oleg Verbitsky
Logical complexity of graphs: a survey CoRR (2010)
Tom Bohman, Alan M. Frieze, Oleg Pikhurko, Clifford D. Smyth
Anti-Ramsey properties of random graphs. J. Comb. Theory, Ser. B 100 (3) (2010)
Tom Bohman, Andrzej Dudek, Alan M. Frieze, Oleg Pikhurko
Flips in Graphs. SIAM J. Discret. Math. 24 (3) (2010)
Oleg Pikhurko
Finding an Unknown Acyclic Orientation of a Given Graph CoRR (2009)
Oleg Pikhurko, Oleg Verbitsky
Logical Complexity of Graphs: A Survey. AMS-ASL Joint Special Session (2009)
Tao Jiang, Oleg Pikhurko
Anti-Ramsey numbers of doubly edge-critical graphs. J. Graph Theory 61 (3) (2009)
Oleg Pikhurko, Jacques Verstraëte
The maximum size of hypergraphs without generalized 4-cycles. J. Comb. Theory, Ser. A 116 (3) (2009)
Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko
Memoryless Rules for Achlioptas Processes. SIAM J. Discret. Math. 23 (2) (2009)
Andrew Beveridge, Oleg Pikhurko
On the connectivity of extremal Ramsey graphs. Australas. J Comb. 41 (2008)
Dhruv Mubayi, Oleg Pikhurko
Constructions of non-principal families in extremal hypergraph theory. Discret. Math. 308 (19) (2008)
Oleg Pikhurko, John R. Schmitt
-saturated graphs. Australas. J Comb. 40 (2008)
Oleg Pikhurko
An exact Turán result for the generalized triangle. Comb. 28 (2) (2008)
Zoltán Füredi, Dhruv Mubayi, Oleg Pikhurko
Quadruple systems with independent neighborhoods. J. Comb. Theory, Ser. A 115 (8) (2008)
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky
Obfuscated Drawings of Planar Graphs CoRR (2008)
Oleg Pikhurko
-Tilings in Hypergraphs of Large Codegree. Graphs Comb. 24 (4) (2008)
Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko
Game chromatic index of graphs with given restrictions on degrees. Theor. Comput. Sci. 407 (1-3) (2008)
Penny E. Haxell, Oleg Pikhurko, Andrew Thomason
Maximum acyclic and fragmented sets in regular graphs. J. Graph Theory 57 (2) (2008)
Malgorzata Bednarska, Oleg Pikhurko
Odd and even cycles in Maker-Breaker games. Eur. J. Comb. 29 (3) (2008)
Felix Lazebnik, Oleg Pikhurko, Andrew J. Woldar
)-graphs. J. Graph Theory 56 (2) (2007)
Oleg Pikhurko, Joel Spencer, Oleg Verbitsky
Decomposable graphs and definitions with no quantifier alternation. Eur. J. Comb. 28 (8) (2007)
Oleg Pikhurko, Teresa Sousa
Minimum H-decompositions of graphs. J. Comb. Theory, Ser. B 97 (6) (2007)
Dhruv Mubayi, Oleg Pikhurko
A new generalization of Mantel's theorem to k-graphs. J. Comb. Theory, Ser. B 97 (4) (2007)
Tom Bohman, Alan M. Frieze, Tomasz Luczak, Oleg Pikhurko, Clifford D. Smyth, Joel Spencer, Oleg Verbitsky
First-Order Definability of Trees and Sparse Random Graphs. Comb. Probab. Comput. 16 (3) (2007)
Oleg Pikhurko
Characterization of Product Anti-Magic Graphs of Large Order. Graphs Comb. 23 (6) (2007)
Oleg Pikhurko
Trees are almost prime. Discret. Math. 307 (11-12) (2007)
Oleg Pikhurko, Helmut Veith, Oleg Verbitsky
The first order definability of graphs: Upper bounds for quantifier depth. Discret. Appl. Math. 154 (17) (2006)
Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits
4-Books of three pages. J. Comb. Theory, Ser. A 113 (5) (2006)
Oleg Pikhurko, Joel Spencer, Oleg Verbitsky
Succinct definitions in the first order theory of graphs. Ann. Pure Appl. Log. 139 (1-3) (2006)
Oleg Pikhurko
Dense edge-magic graphs and thin additive bases. Discret. Math. 306 (17) (2006)
Oleg Pikhurko, Jerzy Wojciechowski
Edge-bandwidth of grids and tori. Theor. Comput. Sci. 369 (1-3) (2006)
Malgorzata Bednarska, Oleg Pikhurko
Biased positional games on matroids. Eur. J. Comb. 26 (2) (2005)
Catherine S. Greenhill, Oleg Pikhurko
Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs. Graphs Comb. 21 (4) (2005)
Oleg Pikhurko, Anusch Taraz
Degree Sequences of F-Free Graphs. Electron. J. Comb. 12 (2005)
Jeong Han Kim, Oleg Pikhurko, Joel H. Spencer, Oleg Verbitsky
How complex are random graphs in first order logic? Random Struct. Algorithms 26 (1-2) (2005)
Béla Bollobás, Oleg Pikhurko
Integer sets with prescribed pairwise differences being distinct. Eur. J. Comb. 26 (5) (2005)
Oleg Pikhurko, Oleg Verbitsky
Descriptive complexity of finite structures: Saving the quantifier rank. J. Symb. Log. 70 (2) (2005)
Oleg Pikhurko
Generating Edge-Labeled Trees. Am. Math. Mon. 112 (10) (2005)
Oleg Pikhurko
Results and Open Problems on Minimum Saturated Hypergraphs. Ars Comb. 72 (2004)
Oleg Pikhurko
Remarks on a paper by H. Bielak on size Ramsey numbers. Period. Math. Hung. 47 (1-2) (2003)
Oleg Pikhurko
Further asymptotic size Ramsey results obtained via linear programming. Discret. Math. 273 (1-3) (2003)
Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits
The Tura'n Density of the Hypergraph {abc, ade, bde, cde}. Electron. J. Comb. 10 (2003)
Oleg Pikhurko
Size ramsey numbers of stars versus 4-chromatic graphs. J. Graph Theory 42 (3) (2003)
Reinhard Diestel, Oleg Pikhurko
On the Cofinality of Infinite Partially Ordered Sets: Factoring a Poset into Lean Essential Subsets. Order 20 (1) (2003)
Oleg Pikhurko
Asymptotic Size Ramsey Results for Bipartite Graphs. SIAM J. Discret. Math. 16 (1) (2002)
Oleg Pikhurko, Andrew Thomason
Disjoint subgraphs of large maximum degree. Discret. Math. 248 (1-3) (2002)
Oleg Pikhurko
Uniform Families and Count Matroids. Graphs Comb. 17 (4) (2001)
Oleg Pikhurko
Size Ramsey Numbers and Integer Programming. Electron. Notes Discret. Math. 10 (2001)
Oleg Pikhurko
Size Ramsey Numbers of Stars Versus 3-chromatic Graphs. Comb. 21 (3) (2001)
Oleg Pikhurko
-stars. Discret. Math. 214 (1-3) (2000)
Oleg Pikhurko
Size Ramsey Numbers Involving Large Stars. Electron. Notes Discret. Math. 5 (2000)
Oleg Pikhurko
On Envy-Free Cake Division. Am. Math. Mon. 107 (8) (2000)
Oleg Pikhurko
Enumeration of Labelled (k, m)-Trees. J. Comb. Theory, Ser. A 86 (1) (1999)
Oleg Pikhurko
The Minimum Size Of Saturated Hypergraphs. Comb. Probab. Comput. 8 (5) (1999)
Oleg Pikhurko
On Edge Decompositions of Posets. Order 16 (3) (1999)