| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Oleg Pikhurko |
The minimum size of 3-graphs without a 4-set spanning no or exactly three edges.  |
Eur. J. Comb.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky |
Untangling planar graphs from a specified vertex position - Hard cases. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tom Bohman, Alan M. Frieze, Oleg Pikhurko, Clifford D. Smyth |
Anti-Ramsey properties of random graphs. |
J. Comb. Theory, Ser. B |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko |
An analytic approach to stability. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko |
Finding an Unknown Acyclic Orientation of a Given Graph. |
Combinatorics, Probability & Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tom Bohman, Alan M. Frieze, Dhruv Mubayi, Oleg Pikhurko |
Hypergraphs with independent neighborhoods. |
Combinatorica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko, Oleg Verbitsky |
Logical complexity of graphs: a survey |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Tom Bohman, Andrzej Dudek, Alan M. Frieze, Oleg Pikhurko |
Flips in Graphs. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tao Jiang, Oleg Pikhurko, Zelealem Yilma |
Set Systems without a Strong Simplex. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko, Jacques Verstraëte |
The maximum size of hypergraphs without generalized 4-cycles. |
J. Comb. Theory, Ser. A |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko |
Finding an Unknown Acyclic Orientation of a Given Graph |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko |
Memoryless Rules for Achlioptas Processes. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tao Jiang, Oleg Pikhurko |
Anti-Ramsey numbers of doubly edge-critical graphs. |
Journal of Graph Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoltán Füredi, Dhruv Mubayi, Oleg Pikhurko |
Quadruple systems with independent neighborhoods. |
J. Comb. Theory, Ser. A |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko |
Game chromatic index of graphs with given restrictions on degrees. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dhruv Mubayi, Oleg Pikhurko |
Constructions of non-principal families in extremal hypergraph theory. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Malgorzata Bednarska, Oleg Pikhurko |
Odd and even cycles in Maker-Breaker games. |
Eur. J. Comb. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko |
Perfect Matchings and K 43 -Tilings in Hypergraphs of Large Codegree. |
Graphs and Combinatorics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko |
An exact Turán result for the generalized triangle. |
Combinatorica |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 05D05, 05C35 |
| 1 | Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky |
Obfuscated Drawings of Planar Graphs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Penny E. Haxell, Oleg Pikhurko, Andrew Thomason |
Maximum acyclic and fragmented sets in regular graphs. |
Journal of Graph Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko, Teresa Sousa |
Minimum H-decompositions of graphs. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dhruv Mubayi, Oleg Pikhurko |
A new generalization of Mantel's theorem to k-graphs. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko |
Trees are almost prime. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko, Joel Spencer, Oleg Verbitsky |
Decomposable graphs and definitions with no quantifier alternation. |
Eur. J. Comb. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Combinatorics, Probability & Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko |
Characterization of Product Anti-Magic Graphs of Large Order. |
Graphs and Combinatorics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Felix Lazebnik, Oleg Pikhurko, Andrew J. Woldar |
Maximum number of colorings of (2k, k2)-graphs. |
Journal of Graph Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits |
4-Books of three pages. |
J. Comb. Theory, Ser. A |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko, Jerzy Wojciechowski |
Edge-bandwidth of grids and tori. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko |
Dense edge-magic graphs and thin additive bases. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko, Joel Spencer, Oleg Verbitsky |
Succinct definitions in the first order theory of graphs. |
Ann. Pure Appl. Logic |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko, Helmut Veith, Oleg Verbitsky |
The first order definability of graphs: Upper bounds for quantifier depth. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Malgorzata Bednarska, Oleg Pikhurko |
Biased positional games on matroids. |
Eur. J. Comb. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, Oleg Pikhurko |
Integer sets with prescribed pairwise differences being distinct. |
Eur. J. Comb. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko, Oleg Verbitsky |
Descriptive complexity of finite structures: Saving the quantifier rank. |
J. Symb. Log. |
2005 |
DBLP BibTeX RDF |
|
| 1 | Oleg Pikhurko, Anusch Taraz |
Degree Sequences of F-Free Graphs. |
Electr. J. Comb. |
2005 |
DBLP BibTeX RDF |
|
| 1 | Jeong Han Kim, Oleg Pikhurko, Joel H. Spencer, Oleg Verbitsky |
How complex are random graphs in first order logic? |
Random Struct. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Catherine S. Greenhill, Oleg Pikhurko |
Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs. |
Graphs and Combinatorics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko |
Results and Open Problems on Minimum Saturated Hypergraphs. |
Ars Comb. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Oleg Pikhurko |
Further asymptotic size Ramsey results obtained via linear programming. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits |
The Tura'n Density of the Hypergraph {abc, ade, bde, cde}. |
Electr. J. Comb. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Reinhard Diestel, Oleg Pikhurko |
On the Cofinality of Infinite Partially Ordered Sets: Factoring a Poset into Lean Essential Subsets. |
Order |
2003 |
DBLP DOI BibTeX RDF |
infinite posets, cofinality, poset decomposition |
| 1 | Oleg Pikhurko, Andrew Thomason |
Disjoint subgraphs of large maximum degree. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko |
Asymptotic Size Ramsey Results for Bipartite Graphs. |
SIAM J. Discrete Math. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Oleg Pikhurko |
Size Ramsey Numbers and Integer Programming. |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko |
Uniform Families and Count Matroids. |
Graphs and Combinatorics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko |
Size Ramsey Numbers of Stars Versus 3-chromatic Graphs. |
Combinatorica |
2001 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 05C35 |
| 1 | Oleg Pikhurko |
Size Ramsey Numbers Involving Large Stars. |
Electronic Notes in Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko |
Asymptotic evaluation of the sat-function for r-stars. |
Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko |
Enumeration of Labelled (k, m)-Trees. |
J. Comb. Theory, Ser. A |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg Pikhurko |
The Minimum Size Of Saturated Hypergraphs. |
Combinatorics, Probability & Computing |
1999 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")