dblp.uni-trier.dewww.uni-trier.de

Oleg Pikhurko

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

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

Coauthor Index

1Malgorzata Bednarska [17] [33]
2Andrew Beveridge [30]
3Tom Bohman [29] [30]
4Béla Bollobás [16]
5Reinhard Diestel [10]
6Alan M. Frieze [29] [30]
7Zoltán Füredi [11] [20] [32]
8Catherine S. Greenhill [15]
9Penny E. Haxell [31]
10Mihyun Kang [36]
11Jeong Han Kim [14]
12Felix Lazebnik [24]
13Tomasz Luczak [29]
14Dhruv Mubayi [26] [32] [34]
15Alexander Ravsky [36]
16Mathias Schacht [36]
17Miklós Simonovits [11] [20]
18Clifford D. Smyth [29]
19Teresa Sousa [25]
20Joel H. Spencer (Joel Spencer) [14] [23] [27] [29]
21Anusch Taraz [18]
22Andrew Thomason [9] [31]
23Helmut Veith [22]
24Oleg Verbitsky [14] [22] [23] [27] [29] [36]
25Jerzy Wojciechowski [19]
26Andrew J. Woldar [24]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)