| 2009 |
|---|
| 37 | EE | Oleg Pikhurko:
Finding an Unknown Acyclic Orientation of a Given Graph
CoRR abs/0904.1229: (2009) |
| 2008 |
|---|
| 36 | EE | Mihyun Kang,
Oleg Pikhurko,
Alexander Ravsky,
Mathias Schacht,
Oleg Verbitsky:
Obfuscated Drawings of Planar Graphs
CoRR abs/0803.0858: (2008) |
| 35 | EE | Oleg Pikhurko:
An exact Turán result for the generalized triangle.
Combinatorica 28(2): 187-208 (2008) |
| 34 | EE | Dhruv Mubayi,
Oleg Pikhurko:
Constructions of non-principal families in extremal hypergraph theory.
Discrete Mathematics 308(19): 4430-4434 (2008) |
| 33 | EE | Malgorzata Bednarska,
Oleg Pikhurko:
Odd and even cycles in Maker-Breaker games.
Eur. J. Comb. 29(3): 742-745 (2008) |
| 32 | EE | Zoltán Füredi,
Dhruv Mubayi,
Oleg Pikhurko:
Quadruple systems with independent neighborhoods.
J. Comb. Theory, Ser. A 115(8): 1552-1560 (2008) |
| 31 | EE | Penny E. Haxell,
Oleg Pikhurko,
Andrew Thomason:
Maximum acyclic and fragmented sets in regular graphs.
Journal of Graph Theory 57(2): 149-156 (2008) |
| 30 | EE | 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): 242-249 (2008) |
| 2007 |
|---|
| 29 | EE | 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 16(3): 375-400 (2007) |
| 28 | EE | Oleg Pikhurko:
Trees are almost prime.
Discrete Mathematics 307(11-12): 1455-1462 (2007) |
| 27 | EE | Oleg Pikhurko,
Joel Spencer,
Oleg Verbitsky:
Decomposable graphs and definitions with no quantifier alternation.
Eur. J. Comb. 28(8): 2264-2283 (2007) |
| 26 | EE | Dhruv Mubayi,
Oleg Pikhurko:
A new generalization of Mantel's theorem to k-graphs.
J. Comb. Theory, Ser. B 97(4): 669-678 (2007) |
| 25 | EE | Oleg Pikhurko,
Teresa Sousa:
Minimum H-decompositions of graphs.
J. Comb. Theory, Ser. B 97(6): 1041-1055 (2007) |
| 24 | EE | Felix Lazebnik,
Oleg Pikhurko,
Andrew J. Woldar:
Maximum number of colorings of (2k, k2)-graphs.
Journal of Graph Theory 56(2): 135-148 (2007) |
| 2006 |
|---|
| 23 | EE | Oleg Pikhurko,
Joel Spencer,
Oleg Verbitsky:
Succinct definitions in the first order theory of graphs.
Ann. Pure Appl. Logic 139(1-3): 74-109 (2006) |
| 22 | EE | Oleg Pikhurko,
Helmut Veith,
Oleg Verbitsky:
The first order definability of graphs: Upper bounds for quantifier depth.
Discrete Applied Mathematics 154(17): 2511-2529 (2006) |
| 21 | EE | Oleg Pikhurko:
Dense edge-magic graphs and thin additive bases.
Discrete Mathematics 306(17): 2097-2107 (2006) |
| 20 | EE | Zoltán Füredi,
Oleg Pikhurko,
Miklós Simonovits:
4-Books of three pages.
J. Comb. Theory, Ser. A 113(5): 882-891 (2006) |
| 19 | EE | Oleg Pikhurko,
Jerzy Wojciechowski:
Edge-bandwidth of grids and tori.
Theor. Comput. Sci. 369(1-3): 35-43 (2006) |
| 2005 |
|---|
| 18 | EE | Oleg Pikhurko,
Anusch Taraz:
Degree Sequences of F-Free Graphs.
Electr. J. Comb. 12: (2005) |
| 17 | EE | Malgorzata Bednarska,
Oleg Pikhurko:
Biased positional games on matroids.
Eur. J. Comb. 26(2): 271-285 (2005) |
| 16 | EE | Béla Bollobás,
Oleg Pikhurko:
Integer sets with prescribed pairwise differences being distinct.
Eur. J. Comb. 26(5): 607-616 (2005) |
| 15 | EE | Catherine S. Greenhill,
Oleg Pikhurko:
Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs.
Graphs and Combinatorics 21(4): 407-419 (2005) |
| 14 | EE | 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): 119-145 (2005) |
| 2004 |
|---|
| 13 | | Oleg Pikhurko:
Results and Open Problems on Minimum Saturated Hypergraphs.
Ars Comb. 72: (2004) |
| 2003 |
|---|
| 12 | EE | Oleg Pikhurko:
Further asymptotic size Ramsey results obtained via linear programming.
Discrete Mathematics 273(1-3): 193-202 (2003) |
| 11 | EE | Zoltán Füredi,
Oleg Pikhurko,
Miklós Simonovits:
The Tura'n Density of the Hypergraph {abc, ade, bde, cde}.
Electr. J. Comb. 10: (2003) |
| 10 | EE | Reinhard Diestel,
Oleg Pikhurko:
On the Cofinality of Infinite Partially Ordered Sets: Factoring a Poset into Lean Essential Subsets.
Order 20(1): 53-66 (2003) |
| 2002 |
|---|
| 9 | EE | Oleg Pikhurko,
Andrew Thomason:
Disjoint subgraphs of large maximum degree.
Discrete Mathematics 248(1-3): 125-141 (2002) |
| 8 | EE | Oleg Pikhurko:
Asymptotic Size Ramsey Results for Bipartite Graphs.
SIAM J. Discrete Math. 16(1): 99-113 (2002) |
| 2001 |
|---|
| 7 | EE | Oleg Pikhurko:
Size Ramsey Numbers of Stars Versus 3-chromatic Graphs.
Combinatorica 21(3): 403-412 (2001) |
| 6 | EE | Oleg Pikhurko:
Size Ramsey Numbers and Integer Programming.
Electronic Notes in Discrete Mathematics 10: 242-244 (2001) |
| 5 | EE | Oleg Pikhurko:
Uniform Families and Count Matroids.
Graphs and Combinatorics 17(4): 729-740 (2001) |
| 2000 |
|---|
| 4 | EE | Oleg Pikhurko:
Asymptotic evaluation of the sat-function for r-stars.
Discrete Mathematics 214(1-3): 275-278 (2000) |
| 3 | EE | Oleg Pikhurko:
Size Ramsey Numbers Involving Large Stars.
Electronic Notes in Discrete Mathematics 5: 260-262 (2000) |
| 1999 |
|---|
| 2 | | Oleg Pikhurko:
The Minimum Size Of Saturated Hypergraphs.
Combinatorics, Probability & Computing 8(5): (1999) |
| 1 | EE | Oleg Pikhurko:
Enumeration of Labelled (k, m)-Trees.
J. Comb. Theory, Ser. A 86(1): 197-199 (1999) |
