Oleg Pikhurko

99 papers Journal 96Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
A Note on the Minimum Size of Turán Systems.
Electron. J. Comb.
Xizhi Liu, Oleg Pikhurko
2026 J jnl
Convergence of spectra of digraph limits.
Eur. J. Comb.
Jan Grebík, Daniel Král', Xizhi Liu, Oleg Pikhurko, Julia Slipantschuk
2026 J jnl
On the quadratic 8-edge case of the Brown-Erdős-Sós problem.
Eur. J. Comb.
Oleg Pikhurko, Shumin Sun
2025 J jnl
A note on extremal constructions for the Erdős-Rademacher problem.
Comb. Probab. Comput.
Xizhi Liu, Oleg Pikhurko
2025 J jnl
New Bounds for the Optimal Density of Covering Single-Insertion Codes via the Turán Density.
IEEE Trans. Inf. Theory
Oleg Pikhurko, Oleg Verbitsky, Maksim Zhukovskii
2025 J jnl
Phase Transition of Degenerate Turán Problems in \({p}\)-Norms.
SIAM J. Discret. Math.
Jun Gao, Xizhi Liu, Jie Ma, Oleg Pikhurko
2024 J jnl
Forcing generalised quasirandom graphs efficiently.
Comb. Probab. Comput.
Andrzej Grzesik, Daniel Král', Oleg Pikhurko
2024 J jnl
Local version of Vizing's theorem for multigraphs.
J. Graph Theory
Clinton T. Conley, Jan Grebík, Oleg Pikhurko
2024 J jnl
New bounds for the optimal density of covering single-insertion codes via the Turán density.
CoRR
Oleg Pikhurko, Oleg Verbitsky, Maksim Zhukovskii
2023 J jnl
Disjoint isomorphic balanced clique subdivisions.
J. Comb. Theory B
Irene Gil Fernández, Joseph Hyde, Hong Liu, Oleg Pikhurko, Zhuo Wu
2023 J jnl
Hypergraph Turán densities can have arbitrarily large algebraic degree.
J. Comb. Theory B
Xizhi Liu, Oleg Pikhurko
2023 J jnl
On the Limit of the Positive $\ell$-Degree Turán Problem.
Electron. J. Comb.
Oleg Pikhurko
2022 J jnl
Moser-Tardos Algorithm with small number of random bits.
CoRR
Endre Csóka, Lukasz Grabowski, András Máthé, Oleg Pikhurko, Konstantinos Tyros
2021 — conf
Borel combinatorics of locally finite graphs.
BCC
Oleg Pikhurko
2021 J jnl
Sharp bounds for decomposing graphs into edges and triangles.
Comb. Probab. Comput.
Adam Blumenthal, Bernard Lidický, Yanitsa Pehova, Florian Pfender, Oleg Pikhurko, Jan Volec
2020 J jnl
Isometric copies of directed trees in orientations of graphs.
J. Graph Theory
Taras O. Banakh, Adam Idzik, Oleg Pikhurko, Igor Protasov, Krzysztof Pszczola
2020 J jnl
Minimizing the number of 5-cycles in graphs with given edge-density.
Comb. Probab. Comput.
Patrick Bennett, Andrzej Dudek, Bernard Lidický, Oleg Pikhurko
2020 J jnl
Supersaturation problem for the bowtie.
Eur. J. Comb.
Mihyun Kang, Tamás Makai, Oleg Pikhurko
2019 J jnl
Edges not in any monochromatic copy of a fixed graph.
J. Comb. Theory B
Hong Liu, Oleg Pikhurko, Maryam Sharifzadeh
2019 J jnl
Minimum Number of Additive Tuples in Groups of Prime Order.
Electron. J. Comb.
Ostap Chervak, Oleg Pikhurko, Katherine Staden
2019 J jnl
Strong forms of stability from flag algebra calculations.
J. Comb. Theory B
Oleg Pikhurko, Jakub Sliacan, Konstantinos Tyros
2018 J jnl
How unproportional must a graph be?
Eur. J. Comb.
Humberto Naves, Oleg Pikhurko, Alex Scott
2017 J jnl
Asymptotic Structure of Graphs with the Minimum Number of Triangles.
Comb. Probab. Comput.
Oleg Pikhurko, Alexander A. Razborov
2017 J jnl
Supersaturation Problem for the Bowtie.
Electron. Notes Discret. Math.
Mihyun Kang, Tamás Makai, Oleg Pikhurko
2017 J jnl
Supersaturation problem for color-critical graphs.
J. Comb. Theory B
Oleg Pikhurko, Zelealem B. Yilma
2017 J jnl
The codegree threshold of K
Electron. Notes Discret. Math.
Victor Falgas-Ravry, Oleg Pikhurko, Emil R. Vaughan, Jan Volec
2017 J jnl
The minimum number of triangles in graphs of given order and size.
Electron. Notes Discret. Math.
Hong Liu, Oleg Pikhurko, Katherine Staden
2015 J jnl
Minimum Number of Monotone Subsequences of Length 4 in Permutations.
Comb. Probab. Comput.
József Balogh, Ping Hu, Bernard Lidický, Oleg Pikhurko, Balázs Udvari, Jan Volec
2015 J jnl
Monochromatic Clique Decompositions of Graphs.
J. Graph Theory
Henry Liu, Oleg Pikhurko, Teresa Sousa
2015 — book
Surveys in Combinatorics 2015
Artur Czumaj, Agelos Georgakopoulos, Daniel Král, Vadim V. Lozin, Oleg Pikhurko
2015 J jnl
The Codegree Threshold for 3-Graphs with Independent Neighborhoods.
SIAM J. Discret. Math.
Victor Falgas-Ravry, Edward Marchant, Oleg Pikhurko, Emil R. Vaughan
2015 J jnl
The Maximal Length of a Gap between r-Graph Turán Densities.
Electron. J. Comb.
Oleg Pikhurko
2014 J jnl
Coloring d-Embeddable k-Uniform Hypergraphs.
Discret. Comput. Geom.
Carl Georg Heise, Konstantinos Panagiotou, Oleg Pikhurko, Anusch Taraz
2014 J jnl
How to Play Dundee.
Ars Comb.
Kevin Litwack, Oleg Pikhurko, Suporn Pongnumkul
2014 J jnl
Martin Gardner's Minimum No-3-in-a-Line Problem.
Am. Math. Mon.
Alec S. Cooper, Oleg Pikhurko, John R. Schmitt, Gregory S. Warrington
2013 J jnl
Exact computation of the hypergraph Turán function for expanded complete 2-graphs.
J. Comb. Theory B
Oleg Pikhurko
2013 J jnl
Minimum Number of
Comb. Probab. Comput.
Oleg Pikhurko, Emil R. Vaughan
2013 J jnl
On Minimum Saturated Matrices.
Graphs Comb.
Andrzej Dudek, Oleg Pikhurko, Andrew Thomason
2012 J jnl
The maximum number of
J. Lond. Math. Soc.
Oleg Pikhurko, Zelealem B. Yilma
2011 J jnl
The minimum size of 3-graphs without a 4-set spanning no or exactly three edges.
Eur. J. Comb.
Oleg Pikhurko
2011 J jnl
Untangling planar graphs from a specified vertex position - Hard cases.
Discret. Appl. Math.
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky
2010 J jnl
An analytic approach to stability.
Discret. Math.
Oleg Pikhurko
2010 J jnl
Anti-Ramsey properties of random graphs.
J. Comb. Theory B
Tom Bohman, Alan M. Frieze, Oleg Pikhurko, Cliff Smyth
2010 J jnl
Finding an Unknown Acyclic Orientation of a Given Graph.
Comb. Probab. Comput.
Oleg Pikhurko
2010 J jnl
Flips in Graphs.
SIAM J. Discret. Math.
Tom Bohman, Andrzej Dudek, Alan M. Frieze, Oleg Pikhurko
2010 J jnl
Hypergraphs with independent neighborhoods.
Comb.
Tom Bohman, Alan M. Frieze, Dhruv Mubayi, Oleg Pikhurko
2010 J jnl
Logical complexity of graphs: a survey
CoRR
Oleg Pikhurko, Oleg Verbitsky
2010 J jnl
Set Systems without a Strong Simplex.
SIAM J. Discret. Math.
Tao Jiang, Oleg Pikhurko, Zelealem B. Yilma
2009 J jnl
Anti-Ramsey numbers of doubly edge-critical graphs.
J. Graph Theory
Tao Jiang, Oleg Pikhurko
2009 J jnl
Finding an Unknown Acyclic Orientation of a Given Graph
CoRR
Oleg Pikhurko
2009 — conf
Logical Complexity of Graphs: A Survey.
AMS-ASL Joint Special Session
Oleg Pikhurko, Oleg Verbitsky
2009 J jnl
Memoryless Rules for Achlioptas Processes.
SIAM J. Discret. Math.
Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko
2009 J jnl
The maximum size of hypergraphs without generalized 4-cycles.
J. Comb. Theory A
Oleg Pikhurko, Jacques Verstraëte
2008 J jnl
A note on minimum K
Australas. J Comb.
Oleg Pikhurko, John R. Schmitt
2008 J jnl
An exact Turán result for the generalized triangle.
Comb.
Oleg Pikhurko
2008 J jnl
Constructions of non-principal families in extremal hypergraph theory.
Discret. Math.
Dhruv Mubayi, Oleg Pikhurko
2008 J jnl
Game chromatic index of graphs with given restrictions on degrees.
Theor. Comput. Sci.
Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko
2008 J jnl
Maximum acyclic and fragmented sets in regular graphs.
J. Graph Theory
Penny E. Haxell, Oleg Pikhurko, Andrew Thomason
2008 J jnl
Obfuscated Drawings of Planar Graphs
CoRR
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky
2008 J jnl
Odd and even cycles in Maker-Breaker games.
Eur. J. Comb.
Malgorzata Bednarska, Oleg Pikhurko
2008 J jnl
On the connectivity of extremal Ramsey graphs.
Australas. J Comb.
Andrew Beveridge, Oleg Pikhurko
2008 J jnl
Perfect Matchings and
Graphs Comb.
Oleg Pikhurko
2008 J jnl
Quadruple systems with independent neighborhoods.
J. Comb. Theory A
Zoltán Füredi, Dhruv Mubayi, Oleg Pikhurko
2007 J jnl
A new generalization of Mantel's theorem to k-graphs.
J. Comb. Theory B
Dhruv Mubayi, Oleg Pikhurko
2007 J jnl
Characterization of Product Anti-Magic Graphs of Large Order.
Graphs Comb.
Oleg Pikhurko
2007 J jnl
Decomposable graphs and definitions with no quantifier alternation.
Eur. J. Comb.
Oleg Pikhurko, Joel Spencer, Oleg Verbitsky
2007 J jnl
First-Order Definability of Trees and Sparse Random Graphs.
Comb. Probab. Comput.
Tom Bohman, Alan M. Frieze, Tomasz Luczak, Oleg Pikhurko, Clifford D. Smyth, Joel Spencer, Oleg Verbitsky
2007 J jnl
Maximum number of colorings of (2
J. Graph Theory
Felix Lazebnik, Oleg Pikhurko, Andrew J. Woldar
2007 J jnl
Minimum H-decompositions of graphs.
J. Comb. Theory B
Oleg Pikhurko, Teresa Sousa
2007 J jnl
Trees are almost prime.
Discret. Math.
Oleg Pikhurko
2006 J jnl
4-Books of three pages.
J. Comb. Theory A
Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits
2006 J jnl
Dense edge-magic graphs and thin additive bases.
Discret. Math.
Oleg Pikhurko
2006 J jnl
Edge-bandwidth of grids and tori.
Theor. Comput. Sci.
Oleg Pikhurko, Jerzy Wojciechowski
2006 J jnl
Succinct definitions in the first order theory of graphs.
Ann. Pure Appl. Log.
Oleg Pikhurko, Joel Spencer, Oleg Verbitsky
2006 J jnl
The first order definability of graphs: Upper bounds for quantifier depth.
Discret. Appl. Math.
Oleg Pikhurko, Helmut Veith, Oleg Verbitsky
2005 J jnl
Biased positional games on matroids.
Eur. J. Comb.
Malgorzata Bednarska, Oleg Pikhurko
2005 J jnl
Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs.
Graphs Comb.
Catherine S. Greenhill, Oleg Pikhurko
2005 J jnl
Degree Sequences of F-Free Graphs.
Electron. J. Comb.
Oleg Pikhurko, Anusch Taraz
2005 J jnl
Descriptive complexity of finite structures: Saving the quantifier rank.
J. Symb. Log.
Oleg Pikhurko, Oleg Verbitsky
2005 J jnl
Generating Edge-Labeled Trees.
Am. Math. Mon.
Oleg Pikhurko
2005 J jnl
How complex are random graphs in first order logic?
Random Struct. Algorithms
Jeong Han Kim, Oleg Pikhurko, Joel H. Spencer, Oleg Verbitsky
2005 J jnl
Integer sets with prescribed pairwise differences being distinct.
Eur. J. Comb.
Béla Bollobás, Oleg Pikhurko
2004 J jnl
Results and Open Problems on Minimum Saturated Hypergraphs.
Ars Comb.
Oleg Pikhurko
2003 J jnl
Further asymptotic size Ramsey results obtained via linear programming.
Discret. Math.
Oleg Pikhurko
2003 J jnl
On the Cofinality of Infinite Partially Ordered Sets: Factoring a Poset into Lean Essential Subsets.
Order
Reinhard Diestel, Oleg Pikhurko
2003 J jnl
Remarks on a paper by H. Bielak on size Ramsey numbers.
Period. Math. Hung.
Oleg Pikhurko
2003 J jnl
Size ramsey numbers of stars versus 4-chromatic graphs.
J. Graph Theory
Oleg Pikhurko
2003 J jnl
The Tura'n Density of the Hypergraph {abc, ade, bde, cde}.
Electron. J. Comb.
Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits
2002 J jnl
Asymptotic Size Ramsey Results for Bipartite Graphs.
SIAM J. Discret. Math.
Oleg Pikhurko
2002 J jnl
Disjoint subgraphs of large maximum degree.
Discret. Math.
Oleg Pikhurko, Andrew Thomason
2001 J jnl
Size Ramsey Numbers and Integer Programming.
Electron. Notes Discret. Math.
Oleg Pikhurko
2001 J jnl
Size Ramsey Numbers of Stars Versus 3-chromatic Graphs.
Comb.
Oleg Pikhurko
2001 J jnl
Uniform Families and Count Matroids.
Graphs Comb.
Oleg Pikhurko
2000 J jnl
Asymptotic evaluation of the sat-function for
Discret. Math.
Oleg Pikhurko
2000 J jnl
On Envy-Free Cake Division.
Am. Math. Mon.
Oleg Pikhurko
2000 J jnl
Size Ramsey Numbers Involving Large Stars.
Electron. Notes Discret. Math.
Oleg Pikhurko
1999 J jnl
Enumeration of Labelled (k, m)-Trees.
J. Comb. Theory A
Oleg Pikhurko
1999 J jnl
On Edge Decompositions of Posets.
Order
Oleg Pikhurko
1999 J jnl
The Minimum Size Of Saturated Hypergraphs.
Comb. Probab. Comput.
Oleg Pikhurko