The SCEAS System
| |||||||

## Search the dblp DataBase
Oleg Pikhurko:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Oleg Pikhurko, Joel Spencer, Oleg Verbitsky
**Succinct definitions in the first order theory of graphs.**[Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2006, v:139, n:1-3, pp:74-109 [Journal] - Oleg Pikhurko
**Results and Open Problems on Minimum Saturated Hypergraphs.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2004, v:72, n:, pp:- [Journal] - Oleg Pikhurko
**Size Ramsey Numbers of Stars Versus 3-chromatic Graphs.**[Citation Graph (0, 0)][DBLP] Combinatorica, 2001, v:21, n:3, pp:403-412 [Journal] - Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits
**The Tura'n Density of the Hypergraph {abc, ade, bde, cde}.**[Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2003, v:10, n:, pp:- [Journal] - Oleg Pikhurko
**The Minimum Size Of Saturated Hypergraphs.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1999, v:8, n:5, pp:- [Journal] - Oleg Pikhurko, Helmut Veith, Oleg Verbitsky
**The first order definability of graphs: Upper bounds for quantifier depth.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:17, pp:2511-2529 [Journal] - Oleg Pikhurko
**Asymptotic evaluation of the sat-function for**[Citation Graph (0, 0)][DBLP]*r*-stars. Discrete Mathematics, 2000, v:214, n:1-3, pp:275-278 [Journal] - Oleg Pikhurko
**Further asymptotic size Ramsey results obtained via linear programming.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:273, n:1-3, pp:193-202 [Journal] - Oleg Pikhurko, Andrew Thomason
**Disjoint subgraphs of large maximum degree.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:248, n:1-3, pp:125-141 [Journal] - Oleg Pikhurko
**Dense edge-magic graphs and thin additive bases.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:17, pp:2097-2107 [Journal] - Oleg Pikhurko
**Trees are almost prime.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:11-12, pp:1455-1462 [Journal] - Malgorzata Bednarska, Oleg Pikhurko
**Biased positional games on matroids.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2005, v:26, n:2, pp:271-285 [Journal] - Béla Bollobás, Oleg Pikhurko
**Integer sets with prescribed pairwise differences being distinct.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2005, v:26, n:5, pp:607-616 [Journal] - Catherine S. Greenhill, Oleg Pikhurko
**Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2005, v:21, n:4, pp:407-419 [Journal] - Oleg Pikhurko
**Uniform Families and Count Matroids.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2001, v:17, n:4, pp:729-740 [Journal] - Oleg Pikhurko
**Enumeration of Labelled (k, m)-Trees.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1999, v:86, n:1, pp:197-199 [Journal] - Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits
**4-Books of three pages.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 2006, v:113, n:5, pp:882-891 [Journal] - Reinhard Diestel, Oleg Pikhurko
**On the Cofinality of Infinite Partially Ordered Sets: Factoring a Poset into Lean Essential Subsets.**[Citation Graph (0, 0)][DBLP] Order, 2003, v:20, n:1, pp:53-66 [Journal] - Jeong Han Kim, Oleg Pikhurko, Joel H. Spencer, Oleg Verbitsky
**How complex are random graphs in first order logic?**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2005, v:26, n:1-2, pp:119-145 [Journal] - Oleg Pikhurko
**Asymptotic Size Ramsey Results for Bipartite Graphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2002, v:16, n:1, pp:99-113 [Journal] - Oleg Pikhurko, Jerzy Wojciechowski
**Edge-bandwidth of grids and tori.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:369, n:1-3, pp:35-43 [Journal] - Oleg Pikhurko, Teresa Sousa
**Minimum H-decompositions of graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2007, v:97, n:6, pp:1041-1055 [Journal] - Dhruv Mubayi, Oleg Pikhurko
**A new generalization of Mantel's theorem to k-graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2007, v:97, n:4, pp:669-678 [Journal] **An exact Turán result for the generalized triangle.**[Citation Graph (, )][DBLP]**Degree Sequences of F-Free Graphs.**[Citation Graph (, )][DBLP]**Obfuscated Drawings of Planar Graphs**[Citation Graph (, )][DBLP]**Finding an Unknown Acyclic Orientation of a Given Graph**[Citation Graph (, )][DBLP]**Logical complexity of graphs: a survey**[Citation Graph (, )][DBLP]**First-Order Definability of Trees and Sparse Random Graphs.**[Citation Graph (, )][DBLP]**Finding an Unknown Acyclic Orientation of a Given Graph.**[Citation Graph (, )][DBLP]**Constructions of non-principal families in extremal hypergraph theory.**[Citation Graph (, )][DBLP]**An analytic approach to stability.**[Citation Graph (, )][DBLP]**Decomposable graphs and definitions with no quantifier alternation.**[Citation Graph (, )][DBLP]**Odd and even cycles in Maker-Breaker games.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |