According to our database
1,
Oleg Pikhurko
authored at least 88 papers
between 1999 and 2024.
Collaborative distances:
2024
Forcing generalised quasirandom graphs efficiently.
Comb. Probab. Comput., January, 2024
New bounds for the optimal density of covering single-insertion codes via the Turán density.
CoRR, 2024
2023
Hypergraph Turán densities can have arbitrarily large algebraic degree.
J. Comb. Theory B, July, 2023
Disjoint isomorphic balanced clique subdivisions.
J. Comb. Theory B, July, 2023
On the Limit of the Positive $\ell$-Degree Turán Problem.
Electron. J. Comb., 2023
2022
Moser-Tardos Algorithm with small number of random bits.
CoRR, 2022
2021
Sharp bounds for decomposing graphs into edges and triangles.
Comb. Probab. Comput., 2021
Borel combinatorics of locally finite graphs.
Proceedings of the Surveys in Combinatorics, 2021
2020
Isometric copies of directed trees in orientations of graphs.
J. Graph Theory, 2020
Minimizing the number of 5-cycles in graphs with given edge-density.
Comb. Probab. Comput., 2020
2019
Strong forms of stability from flag algebra calculations.
J. Comb. Theory B, 2019
Edges not in any monochromatic copy of a fixed graph.
J. Comb. Theory B, 2019
Minimum Number of Additive Tuples in Groups of Prime Order.
Electron. J. Comb., 2019
2018
How unproportional must a graph be?
Eur. J. Comb., 2018
2017
Supersaturation problem for color-critical graphs.
J. Comb. Theory B, 2017
The minimum number of triangles in graphs of given order and size.
Electron. Notes Discret. Math., 2017
Supersaturation Problem for the Bowtie.
Electron. Notes Discret. Math., 2017
The codegree threshold of K<sub>4</sub><sup>-</sup>.
Electron. Notes Discret. Math., 2017
Asymptotic Structure of Graphs with the Minimum Number of Triangles.
Comb. Probab. Comput., 2017
2015
The Codegree Threshold for 3-Graphs with Independent Neighborhoods.
SIAM J. Discret. Math., 2015
Monochromatic Clique Decompositions of Graphs.
J. Graph Theory, 2015
Minimum Number of Monotone Subsequences of Length 4 in Permutations.
Comb. Probab. Comput., 2015
The Maximal Length of a Gap between r-Graph Turán Densities.
Electron. J. Comb., 2015
2014
Martin Gardner's Minimum No-3-in-a-Line Problem.
Am. Math. Mon., 2014
Coloring d-Embeddable k-Uniform Hypergraphs.
Discret. Comput. Geom., 2014
2013
Exact computation of the hypergraph Turán function for expanded complete 2-graphs.
J. Comb. Theory B, 2013
On Minimum Saturated Matrices.
Graphs Comb., 2013
Minimum Number of <i>k</i>-Cliques in Graphs with Bounded Independence Number.
Comb. Probab. Comput., 2013
2012
The maximum number of <i>K</i><sub>3</sub>-free and <i>K</i><sub>4</sub>-free edge 4-colorings.
J. Lond. Math. Soc., 2012
2011
The minimum size of 3-graphs without a 4-set spanning no or exactly three edges.
Eur. J. Comb., 2011
Untangling planar graphs from a specified vertex position - Hard cases.
Discret. Appl. Math., 2011
2010
Set Systems without a Strong Simplex.
SIAM J. Discret. Math., 2010
SIAM J. Discret. Math., 2010
Anti-Ramsey properties of random graphs.
J. Comb. Theory B, 2010
An analytic approach to stability.
Discret. Math., 2010
Finding an Unknown Acyclic Orientation of a Given Graph.
Comb. Probab. Comput., 2010
Hypergraphs with independent neighborhoods.
Comb., 2010
2009
Memoryless Rules for Achlioptas Processes.
SIAM J. Discret. Math., 2009
Anti-Ramsey numbers of doubly edge-critical graphs.
J. Graph Theory, 2009
The maximum size of hypergraphs without generalized 4-cycles.
J. Comb. Theory A, 2009
Logical Complexity of Graphs: A Survey.
Proceedings of the Model Theoretic Methods in Finite Combinatorics, 2009
2008
Game chromatic index of graphs with given restrictions on degrees.
Theor. Comput. Sci., 2008
Maximum acyclic and fragmented sets in regular graphs.
J. Graph Theory, 2008
Quadruple systems with independent neighborhoods.
J. Comb. Theory A, 2008
Perfect Matchings and <i>K</i> <sub>4</sub><sup>3</sup> -Tilings in Hypergraphs of Large Codegree.
Graphs Comb., 2008
Odd and even cycles in Maker-Breaker games.
Eur. J. Comb., 2008
Constructions of non-principal families in extremal hypergraph theory.
Discret. Math., 2008
Obfuscated Drawings of Planar Graphs
CoRR, 2008
An exact Turán result for the generalized triangle.
Comb., 2008
A note on minimum K<sub>2, 3</sub>-saturated graphs.
Australas. J Comb., 2008
On the connectivity of extremal Ramsey graphs.
Australas. J Comb., 2008
2007
Maximum number of colorings of (2<i>k, k</i><sup>2</sup>)-graphs.
J. Graph Theory, 2007
Minimum H-decompositions of graphs.
J. Comb. Theory B, 2007
A new generalization of Mantel's theorem to k-graphs.
J. Comb. Theory B, 2007
Characterization of Product Anti-Magic Graphs of Large Order.
Graphs Comb., 2007
Decomposable graphs and definitions with no quantifier alternation.
Eur. J. Comb., 2007
First-Order Definability of Trees and Sparse Random Graphs.
Comb. Probab. Comput., 2007
2006
Edge-bandwidth of grids and tori.
Theor. Comput. Sci., 2006
Dense edge-magic graphs and thin additive bases.
Discret. Math., 2006
The first order definability of graphs: Upper bounds for quantifier depth.
Discret. Appl. Math., 2006
Succinct definitions in the first order theory of graphs.
Ann. Pure Appl. Log., 2006
2005
Generating Edge-Labeled Trees.
Am. Math. Mon., 2005
How complex are random graphs in first order logic?
Random Struct. Algorithms, 2005
Descriptive complexity of finite structures: Saving the quantifier rank.
J. Symb. Log., 2005
Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs.
Graphs Comb., 2005
Integer sets with prescribed pairwise differences being distinct.
Eur. J. Comb., 2005
Biased positional games on matroids.
Eur. J. Comb., 2005
Degree Sequences of F-Free Graphs.
Electron. J. Comb., 2005
2004
Results and Open Problems on Minimum Saturated Hypergraphs.
Ars Comb., 2004
2003
Remarks on a paper by H. Bielak on size Ramsey numbers.
Period. Math. Hung., 2003
On the Cofinality of Infinite Partially Ordered Sets: Factoring a Poset into Lean Essential Subsets.
Order, 2003
Size ramsey numbers of stars versus 4-chromatic graphs.
J. Graph Theory, 2003
Further asymptotic size Ramsey results obtained via linear programming.
Discret. Math., 2003
The Tura'n Density of the Hypergraph {abc, ade, bde, cde}.
Electron. J. Comb., 2003
2002
Asymptotic Size Ramsey Results for Bipartite Graphs.
SIAM J. Discret. Math., 2002
Disjoint subgraphs of large maximum degree.
Discret. Math., 2002
2001
Uniform Families and Count Matroids.
Graphs Comb., 2001
Size Ramsey Numbers and Integer Programming.
Electron. Notes Discret. Math., 2001
Size Ramsey Numbers of Stars Versus 3-chromatic Graphs.
Comb., 2001
2000
On Envy-Free Cake Division.
Am. Math. Mon., 2000
Size Ramsey Numbers Involving Large Stars.
Electron. Notes Discret. Math., 2000
Asymptotic evaluation of the sat-function for <i>r</i>-stars.
Discret. Math., 2000
1999
On Edge Decompositions of Posets.
Order, 1999
Enumeration of Labelled (k, m)-Trees.
J. Comb. Theory A, 1999
The Minimum Size Of Saturated Hypergraphs.
Comb. Probab. Comput., 1999
