The Minimum Size Of Saturated Hypergraphs. - Oleg Pikhurko (Comb. Probab. Comput., 1999)

Enumeration of Labelled (k, m)-Trees. - Oleg Pikhurko (J. Comb. Theory A, 1999)

On Edge Decompositions of Posets. - Oleg Pikhurko (Order, 1999)

Asymptotic evaluation of the sat-function for r-stars. - Oleg Pikhurko (Discret. Math., 2000)

Size Ramsey Numbers Involving Large Stars. - Oleg Pikhurko (Electron. Notes Discret. Math., 2000)

On Envy-Free Cake Division. - Oleg Pikhurko (Am. Math. Mon., 2000)

Size Ramsey Numbers of Stars Versus 3-chromatic Graphs. - Oleg Pikhurko (Comb., 2001)

Size Ramsey Numbers and Integer Programming. - Oleg Pikhurko (Electron. Notes Discret. Math., 2001)

Uniform Families and Count Matroids. - Oleg Pikhurko (Graphs Comb., 2001)

Disjoint subgraphs of large maximum degree. - Oleg Pikhurko; Andrew Thomason 001 (Discret. Math., 2002)

Asymptotic Size Ramsey Results for Bipartite Graphs. - Oleg Pikhurko (SIAM J. Discret. Math., 2002)

The Tura'n Density of the Hypergraph {abc, ade, bde, cde}. - Zoltán Füredi; Oleg Pikhurko; Miklós Simonovits (Electron. J. Comb., 2003)

Further asymptotic size Ramsey results obtained via linear programming. - Oleg Pikhurko (Discret. Math., 2003)

Size ramsey numbers of stars versus 4-chromatic graphs. - Oleg Pikhurko (J. Graph Theory, 2003)

On the Cofinality of Infinite Partially Ordered Sets: Factoring a Poset into Lean Essential Subsets. - Reinhard Diestel; Oleg Pikhurko (Order, 2003)

Remarks on a paper by H. Bielak on size Ramsey numbers. - Oleg Pikhurko (Period. Math. Hung., 2003)

Results and Open Problems on Minimum Saturated Hypergraphs. - Oleg Pikhurko (Ars Comb., 2004)

Degree Sequences of F-Free Graphs. - Oleg Pikhurko; Anusch Taraz (Electron. J. Comb., 2005)

Biased positional games on matroids. - Malgorzata Bednarska; Oleg Pikhurko (Eur. J. Comb., 2005)

Integer sets with prescribed pairwise differences being distinct. - Béla Bollobás; Oleg Pikhurko (Eur. J. Comb., 2005)

Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs. - Catherine S. Greenhill; Oleg Pikhurko (Graphs Comb., 2005)

Descriptive complexity of finite structures: Saving the quantifier rank. - Oleg Pikhurko; Oleg Verbitsky 001 (J. Symb. Log., 2005)

How complex are random graphs in first order logic? - Jeong Han Kim; Oleg Pikhurko; Joel H. Spencer; Oleg Verbitsky 001 (Random Struct. Algorithms, 2005)

Generating Edge-Labeled Trees. - Oleg Pikhurko (Am. Math. Mon., 2005)

Succinct definitions in the first order theory of graphs. - Oleg Pikhurko; Joel Spencer; Oleg Verbitsky 001 (Ann. Pure Appl. Log., 2006)

The first order definability of graphs: Upper bounds for quantifier depth. - Oleg Pikhurko; Helmut Veith; Oleg Verbitsky 001 (Discret. Appl. Math., 2006)

Dense edge-magic graphs and thin additive bases. - Oleg Pikhurko (Discret. Math., 2006)

4-Books of three pages. - Zoltán Füredi; Oleg Pikhurko; Miklós Simonovits (J. Comb. Theory A, 2006)

Edge-bandwidth of grids and tori. - Oleg Pikhurko; Jerzy Wojciechowski (Theor. Comput. Sci., 2006)

First-Order Definability of Trees and Sparse Random Graphs. - Tom Bohman; Alan M. Frieze; Tomasz Luczak 001; Oleg Pikhurko; Clifford D. Smyth; Joel Spencer; Oleg Verbitsky 001 (Comb. Probab. Comput., 2007)

Trees are almost prime. - Oleg Pikhurko (Discret. Math., 2007)

Decomposable graphs and definitions with no quantifier alternation. - Oleg Pikhurko; Joel Spencer; Oleg Verbitsky 001 (Eur. J. Comb., 2007)

Characterization of Product Anti-Magic Graphs of Large Order. - Oleg Pikhurko (Graphs Comb., 2007)

A new generalization of Mantel's theorem to k-graphs. - Dhruv Mubayi; Oleg Pikhurko (J. Comb. Theory B, 2007)

Minimum H-decompositions of graphs. - Oleg Pikhurko; Teresa Sousa (J. Comb. Theory B, 2007)

Maximum number of colorings of (2k, k2)-graphs. - Felix Lazebnik; Oleg Pikhurko; Andrew J. Woldar (J. Graph Theory, 2007)

On the connectivity of extremal Ramsey graphs. - Andrew Beveridge; Oleg Pikhurko (Australas. J Comb., 2008)

A note on minimum K2, 3-saturated graphs. - Oleg Pikhurko; John R. Schmitt (Australas. J Comb., 2008)

An exact Turán result for the generalized triangle. - Oleg Pikhurko (Comb., 2008)

Obfuscated Drawings of Planar Graphs - Mihyun Kang; Oleg Pikhurko; Alexander Ravsky; Mathias Schacht; Oleg Verbitsky 001 (CoRR, 2008)

Constructions of non-principal families in extremal hypergraph theory. - Dhruv Mubayi; Oleg Pikhurko (Discret. Math., 2008)

Odd and even cycles in Maker-Breaker games. - Malgorzata Bednarska; Oleg Pikhurko (Eur. J. Comb., 2008)

Perfect Matchings and K 43 -Tilings in Hypergraphs of Large Codegree. - Oleg Pikhurko (Graphs Comb., 2008)

Quadruple systems with independent neighborhoods. - Zoltán Füredi; Dhruv Mubayi; Oleg Pikhurko (J. Comb. Theory A, 2008)

Maximum acyclic and fragmented sets in regular graphs. - Penny E. Haxell; Oleg Pikhurko; Andrew Thomason 001 (J. Graph Theory, 2008)

Game chromatic index of graphs with given restrictions on degrees. - Andrew Beveridge; Tom Bohman; Alan M. Frieze; Oleg Pikhurko (Theor. Comput. Sci., 2008)

Logical Complexity of Graphs: A Survey. - Oleg Pikhurko; Oleg Verbitsky 001 (AMS-ASL Joint Special Session, 2009)

The maximum size of hypergraphs without generalized 4-cycles. - Oleg Pikhurko; Jacques Verstraëte (J. Comb. Theory A, 2009)

Anti-Ramsey numbers of doubly edge-critical graphs. - Tao Jiang 003; Oleg Pikhurko (J. Graph Theory, 2009)

Memoryless Rules for Achlioptas Processes. - Andrew Beveridge; Tom Bohman; Alan M. Frieze; Oleg Pikhurko (SIAM J. Discret. Math., 2009)

Hypergraphs with independent neighborhoods. - Tom Bohman; Alan M. Frieze; Dhruv Mubayi; Oleg Pikhurko (Comb., 2010)

Finding an Unknown Acyclic Orientation of a Given Graph. - Oleg Pikhurko (Comb. Probab. Comput., 2010)

An analytic approach to stability. - Oleg Pikhurko (Discret. Math., 2010)

Anti-Ramsey properties of random graphs. - Tom Bohman; Alan M. Frieze; Oleg Pikhurko; Cliff Smyth 001 (J. Comb. Theory B, 2010)

Flips in Graphs. - Tom Bohman; Andrzej Dudek; Alan M. Frieze; Oleg Pikhurko (SIAM J. Discret. Math., 2010)

Set Systems without a Strong Simplex. - Tao Jiang 003; Oleg Pikhurko; Zelealem B. Yilma (SIAM J. Discret. Math., 2010)

Untangling planar graphs from a specified vertex position - Hard cases. - Mihyun Kang; Oleg Pikhurko; Alexander Ravsky; Mathias Schacht; Oleg Verbitsky 001 (Discret. Appl. Math., 2011)

The minimum size of 3-graphs without a 4-set spanning no or exactly three edges. - Oleg Pikhurko (Eur. J. Comb., 2011)

The maximum number of K3-free and K4-free edge 4-colorings. - Oleg Pikhurko; Zelealem B. Yilma (J. Lond. Math. Soc., 2012)

Minimum Number of k-Cliques in Graphs with Bounded Independence Number. - Oleg Pikhurko; Emil R. Vaughan (Comb. Probab. Comput., 2013)

On Minimum Saturated Matrices. - Andrzej Dudek; Oleg Pikhurko; Andrew Thomason 001 (Graphs Comb., 2013)

Exact computation of the hypergraph Turán function for expanded complete 2-graphs. - Oleg Pikhurko (J. Comb. Theory B, 2013)

How to Play Dundee. - Kevin Litwack; Oleg Pikhurko; Suporn Pongnumkul (Ars Comb., 2014)

Coloring d-Embeddable k-Uniform Hypergraphs. - Carl Georg Heise; Konstantinos Panagiotou; Oleg Pikhurko; Anusch Taraz (Discret. Comput. Geom., 2014)

Martin Gardner's Minimum No-3-in-a-Line Problem. - Alec S. Cooper; Oleg Pikhurko; John R. Schmitt; Gregory S. Warrington (Am. Math. Mon., 2014)

The Maximal Length of a Gap between r-Graph Turán Densities. - Oleg Pikhurko (Electron. J. Comb., 2015)

Minimum Number of Monotone Subsequences of Length 4 in Permutations. - József Balogh; Ping Hu 004; Bernard Lidický; Oleg Pikhurko; Balázs Udvari; Jan Volec (Comb. Probab. Comput., 2015)

Monochromatic Clique Decompositions of Graphs. - Henry Liu; Oleg Pikhurko; Teresa Sousa (J. Graph Theory, 2015)

The Codegree Threshold for 3-Graphs with Independent Neighborhoods. - Victor Falgas-Ravry; Edward Marchant; Oleg Pikhurko; Emil R. Vaughan (SIAM J. Discret. Math., 2015)

Asymptotic Structure of Graphs with the Minimum Number of Triangles. - Oleg Pikhurko; Alexander A. Razborov (Comb. Probab. Comput., 2017)

The codegree threshold of K4-. - Victor Falgas-Ravry; Oleg Pikhurko; Emil R. Vaughan; Jan Volec (Electron. Notes Discret. Math., 2017)

Supersaturation Problem for the Bowtie. - Mihyun Kang; Tamás Makai; Oleg Pikhurko (Electron. Notes Discret. Math., 2017)

The minimum number of triangles in graphs of given order and size. - Hong Liu 010; Oleg Pikhurko; Katherine Staden (Electron. Notes Discret. Math., 2017)

Supersaturation problem for color-critical graphs. - Oleg Pikhurko; Zelealem B. Yilma (J. Comb. Theory B, 2017)

How unproportional must a graph be? - Humberto Naves; Oleg Pikhurko; Alex Scott 001 (Eur. J. Comb., 2018)

Minimum Number of Additive Tuples in Groups of Prime Order. - Ostap Chervak; Oleg Pikhurko; Katherine Staden (Electron. J. Comb., 2019)

Edges not in any monochromatic copy of a fixed graph. - Hong Liu 010; Oleg Pikhurko; Maryam Sharifzadeh (J. Comb. Theory B, 2019)

Strong forms of stability from flag algebra calculations. - Oleg Pikhurko; Jakub Sliacan; Konstantinos Tyros (J. Comb. Theory B, 2019)

Minimizing the number of 5-cycles in graphs with given edge-density. - Patrick Bennett; Andrzej Dudek; Bernard Lidický; Oleg Pikhurko (Comb. Probab. Comput., 2020)

Isometric copies of directed trees in orientations of graphs. - Taras O. Banakh; Adam Idzik; Oleg Pikhurko; Igor Protasov; Krzysztof Pszczola (J. Graph Theory, 2020)

Borel combinatorics of locally finite graphs. - Oleg Pikhurko (BCC, 2021)

Sharp bounds for decomposing graphs into edges and triangles. - Adam Blumenthal; Bernard Lidický; Yanitsa Pehova; Florian Pfender; Oleg Pikhurko; Jan Volec (Comb. Probab. Comput., 2021)

Moser-Tardos Algorithm with small number of random bits. - Endre Csóka; Lukasz Grabowski; András Máthé; Oleg Pikhurko; Konstantinos Tyros (CoRR, 2022)

On the Limit of the Positive $ ell$-Degree Turán Problem. - Oleg Pikhurko (Electron. J. Comb., 2023)

Disjoint isomorphic balanced clique subdivisions. - Irene Gil Fernández; Joseph Hyde; Hong Liu 010; Oleg Pikhurko; Zhuo Wu (J. Comb. Theory B, 2023)

Hypergraph Turán densities can have arbitrarily large algebraic degree. - Xizhi Liu; Oleg Pikhurko (J. Comb. Theory B, 2023)

Local version of Vizing's theorem for multigraphs. - Clinton T. Conley; Jan Grebík; Oleg Pikhurko (J. Graph Theory, 2024)

Forcing generalised quasirandom graphs efficiently. - Andrzej Grzesik; Daniel Král'; Oleg Pikhurko (Comb. Probab. Comput., 2024)

A note on extremal constructions for the Erdős-Rademacher problem. - Xizhi Liu; Oleg Pikhurko (Comb. Probab. Comput., 2025)

Phase Transition of Degenerate Turán Problems in ({p} )-Norms. - Jun Gao; Xizhi Liu; Jie Ma; Oleg Pikhurko (SIAM J. Discret. Math., 2025)

New Bounds for the Optimal Density of Covering Single-Insertion Codes via the Turán Density. - Oleg Pikhurko; Oleg Verbitsky 001; Maksim Zhukovskii (IEEE Trans. Inf. Theory, 2025)