default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOleg Pikhurko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j84]Andrzej Grzesik
, Daniel Král', Oleg Pikhurko:
Forcing generalised quasirandom graphs efficiently. Comb. Probab. Comput. 33(1): 16-31 (2024)- [i5]Oleg Pikhurko, Oleg Verbitsky, Maksim Zhukovskii:
New bounds for the optimal density of covering single-insertion codes via the Turán density. CoRR abs/2409.06425 (2024) - 2023
- [j83]Oleg Pikhurko:
On the Limit of the Positive $\ell$-Degree Turán Problem. Electron. J. Comb. 30(3) (2023) - [j82]Xizhi Liu, Oleg Pikhurko:
Hypergraph Turán densities can have arbitrarily large algebraic degree. J. Comb. Theory B 161: 407-416 (2023) - [j81]Irene Gil Fernández, Joseph Hyde, Hong Liu, Oleg Pikhurko, Zhuo Wu:
Disjoint isomorphic balanced clique subdivisions. J. Comb. Theory B 161: 417-436 (2023) - 2022
- [i4]Endre Csóka, Lukasz Grabowski, András Máthé, Oleg Pikhurko, Konstantinos Tyros:
Moser-Tardos Algorithm with small number of random bits. CoRR abs/2203.05888 (2022) - 2021
- [j80]Adam Blumenthal, Bernard Lidický, Yanitsa Pehova, Florian Pfender, Oleg Pikhurko, Jan Volec:
Sharp bounds for decomposing graphs into edges and triangles. Comb. Probab. Comput. 30(2): 271-287 (2021) - [c2]Oleg Pikhurko:
Borel combinatorics of locally finite graphs. BCC 2021: 267-320 - 2020
- [j79]Patrick Bennett, Andrzej Dudek, Bernard Lidický, Oleg Pikhurko:
Minimizing the number of 5-cycles in graphs with given edge-density. Comb. Probab. Comput. 29(1): 44-67 (2020) - [j78]Mihyun Kang, Tamás Makai, Oleg Pikhurko:
Supersaturation problem for the bowtie. Eur. J. Comb. 88: 103107 (2020) - [j77]Taras O. Banakh, Adam Idzik, Oleg Pikhurko, Igor Protasov, Krzysztof Pszczola:
Isometric copies of directed trees in orientations of graphs. J. Graph Theory 94(2): 175-191 (2020)
2010 – 2019
- 2019
- [j76]Ostap Chervak, Oleg Pikhurko, Katherine Staden:
Minimum Number of Additive Tuples in Groups of Prime Order. Electron. J. Comb. 26(1): 1 (2019) - [j75]Hong Liu, Oleg Pikhurko, Maryam Sharifzadeh:
Edges not in any monochromatic copy of a fixed graph. J. Comb. Theory B 135: 16-43 (2019) - [j74]Oleg Pikhurko, Jakub Sliacan, Konstantinos Tyros:
Strong forms of stability from flag algebra calculations. J. Comb. Theory B 135: 129-178 (2019) - 2018
- [j73]Humberto Naves, Oleg Pikhurko, Alex Scott:
How unproportional must a graph be? Eur. J. Comb. 73: 138-152 (2018) - 2017
- [j72]Oleg Pikhurko, Alexander A. Razborov:
Asymptotic Structure of Graphs with the Minimum Number of Triangles. Comb. Probab. Comput. 26(1): 138-160 (2017) - [j71]Victor Falgas-Ravry, Oleg Pikhurko, Emil R. Vaughan, Jan Volec:
The codegree threshold of K4-. Electron. Notes Discret. Math. 61: 407-413 (2017) - [j70]Mihyun Kang, Tamás Makai, Oleg Pikhurko:
Supersaturation Problem for the Bowtie. Electron. Notes Discret. Math. 61: 679-685 (2017) - [j69]Hong Liu, Oleg Pikhurko, Katherine Staden:
The minimum number of triangles in graphs of given order and size. Electron. Notes Discret. Math. 61: 805-811 (2017) - [j68]Oleg Pikhurko, Zelealem B. Yilma:
Supersaturation problem for color-critical graphs. J. Comb. Theory B 123: 148-185 (2017) - 2015
- [j67]Oleg Pikhurko:
The Maximal Length of a Gap between r-Graph Turán Densities. Electron. J. Comb. 22(4): 4 (2015) - [j66]József Balogh, Ping Hu, Bernard Lidický, Oleg Pikhurko, Balázs Udvari, Jan Volec:
Minimum Number of Monotone Subsequences of Length 4 in Permutations. Comb. Probab. Comput. 24(4): 658-679 (2015) - [j65]Henry Liu, Oleg Pikhurko, Teresa Sousa:
Monochromatic Clique Decompositions of Graphs. J. Graph Theory 80(4): 287-298 (2015) - [j64]Victor Falgas-Ravry, Edward Marchant, Oleg Pikhurko, Emil R. Vaughan:
The Codegree Threshold for 3-Graphs with Independent Neighborhoods. SIAM J. Discret. Math. 29(3): 1504-1539 (2015) - [e1]Artur Czumaj, Agelos Georgakopoulos, Daniel Král, Vadim V. Lozin, Oleg Pikhurko:
Surveys in Combinatorics 2015. London Mathematical Society Lecture Note Series 424, Cambridge University Press 2015, ISBN 9781316106853 [contents] - 2014
- [j63]Kevin Litwack, Oleg Pikhurko, Suporn Pongnumkul:
How to Play Dundee. Ars Comb. 115: 63-88 (2014) - [j62]Carl Georg Heise, Konstantinos Panagiotou, Oleg Pikhurko, Anusch Taraz:
Coloring d-Embeddable k-Uniform Hypergraphs. Discret. Comput. Geom. 52(4): 663-679 (2014) - [j61]Alec S. Cooper, Oleg Pikhurko, John R. Schmitt, Gregory S. Warrington:
Martin Gardner's Minimum No-3-in-a-Line Problem. Am. Math. Mon. 121(3): 213-221 (2014) - 2013
- [j60]Oleg Pikhurko, Emil R. Vaughan:
Minimum Number of k-Cliques in Graphs with Bounded Independence Number. Comb. Probab. Comput. 22(6): 910-934 (2013) - [j59]Andrzej Dudek, Oleg Pikhurko, Andrew Thomason:
On Minimum Saturated Matrices. Graphs Comb. 29(5): 1269-1286 (2013) - [j58]Oleg Pikhurko:
Exact computation of the hypergraph Turán function for expanded complete 2-graphs. J. Comb. Theory B 103(2): 220-225 (2013) - 2012
- [j57]Oleg Pikhurko, Zelealem B. Yilma:
The maximum number of K3-free and K4-free edge 4-colorings. J. Lond. Math. Soc. 85(3): 593-615 (2012) - 2011
- [j56]Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky:
Untangling planar graphs from a specified vertex position - Hard cases. Discret. Appl. Math. 159(8): 789-799 (2011) - [j55]Oleg Pikhurko:
The minimum size of 3-graphs without a 4-set spanning no or exactly three edges. Eur. J. Comb. 32(7): 1142-1155 (2011) - 2010
- [j54]Tom Bohman, Alan M. Frieze, Dhruv Mubayi, Oleg Pikhurko:
Hypergraphs with independent neighborhoods. Comb. 30(3): 277-293 (2010) - [j53]Oleg Pikhurko:
Finding an Unknown Acyclic Orientation of a Given Graph. Comb. Probab. Comput. 19(1): 121-131 (2010) - [j52]Oleg Pikhurko:
An analytic approach to stability. Discret. Math. 310(21): 2951-2964 (2010) - [j51]Tom Bohman, Alan M. Frieze, Oleg Pikhurko, Cliff Smyth:
Anti-Ramsey properties of random graphs. J. Comb. Theory B 100(3): 299-312 (2010) - [j50]Tao Jiang, Oleg Pikhurko, Zelealem B. Yilma:
Set Systems without a Strong Simplex. SIAM J. Discret. Math. 24(3): 1038-1045 (2010) - [j49]Tom Bohman, Andrzej Dudek, Alan M. Frieze, Oleg Pikhurko:
Flips in Graphs. SIAM J. Discret. Math. 24(3): 1046-1055 (2010) - [i3]Oleg Pikhurko, Oleg Verbitsky:
Logical complexity of graphs: a survey. CoRR abs/1003.4865 (2010)
2000 – 2009
- 2009
- [j48]Oleg Pikhurko, Jacques Verstraëte:
The maximum size of hypergraphs without generalized 4-cycles. J. Comb. Theory A 116(3): 637-649 (2009) - [j47]Tao Jiang, Oleg Pikhurko:
Anti-Ramsey numbers of doubly edge-critical graphs. J. Graph Theory 61(3): 210-218 (2009) - [j46]Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko:
Memoryless Rules for Achlioptas Processes. SIAM J. Discret. Math. 23(2): 993-1008 (2009) - [c1]Oleg Pikhurko, Oleg Verbitsky:
Logical Complexity of Graphs: A Survey. AMS-ASL Joint Special Session 2009: 129-180 - [i2]Oleg Pikhurko:
Finding an Unknown Acyclic Orientation of a Given Graph. CoRR abs/0904.1229 (2009) - 2008
- [j45]Oleg Pikhurko, John R. Schmitt:
A note on minimum K2, 3-saturated graphs. Australas. J Comb. 40: 211-216 (2008) - [j44]Andrew Beveridge, Oleg Pikhurko:
On the connectivity of extremal Ramsey graphs. Australas. J Comb. 41: 57-62 (2008) - [j43]Oleg Pikhurko:
An exact Turán result for the generalized triangle. Comb. 28(2): 187-208 (2008) - [j42]Dhruv Mubayi, Oleg Pikhurko:
Constructions of non-principal families in extremal hypergraph theory. Discret. Math. 308(19): 4430-4434 (2008) - [j41]Malgorzata Bednarska, Oleg Pikhurko:
Odd and even cycles in Maker-Breaker games. Eur. J. Comb. 29(3): 742-745 (2008) - [j40]Oleg Pikhurko:
Perfect Matchings and K 43 -Tilings in Hypergraphs of Large Codegree. Graphs Comb. 24(4): 391-404 (2008) - [j39]Zoltán Füredi, Dhruv Mubayi, Oleg Pikhurko:
Quadruple systems with independent neighborhoods. J. Comb. Theory A 115(8): 1552-1560 (2008) - [j38]Penny E. Haxell, Oleg Pikhurko, Andrew Thomason:
Maximum acyclic and fragmented sets in regular graphs. J. Graph Theory 57(2): 149-156 (2008) - [j37]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) - [i1]Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky:
Obfuscated Drawings of Planar Graphs. CoRR abs/0803.0858 (2008) - 2007
- [j36]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. Comb. Probab. Comput. 16(3): 375-400 (2007) - [j35]Oleg Pikhurko:
Trees are almost prime. Discret. Math. 307(11-12): 1455-1462 (2007) - [j34]Oleg Pikhurko, Joel Spencer, Oleg Verbitsky:
Decomposable graphs and definitions with no quantifier alternation. Eur. J. Comb. 28(8): 2264-2283 (2007) - [j33]Oleg Pikhurko:
Characterization of Product Anti-Magic Graphs of Large Order. Graphs Comb. 23(6): 681-689 (2007) - [j32]Dhruv Mubayi, Oleg Pikhurko:
A new generalization of Mantel's theorem to k-graphs. J. Comb. Theory B 97(4): 669-678 (2007) - [j31]Oleg Pikhurko, Teresa Sousa:
Minimum H-decompositions of graphs. J. Comb. Theory B 97(6): 1041-1055 (2007) - [j30]Felix Lazebnik, Oleg Pikhurko, Andrew J. Woldar:
Maximum number of colorings of (2k, k2)-graphs. J. Graph Theory 56(2): 135-148 (2007) - 2006
- [j29]Oleg Pikhurko, Joel Spencer, Oleg Verbitsky:
Succinct definitions in the first order theory of graphs. Ann. Pure Appl. Log. 139(1-3): 74-109 (2006) - [j28]Oleg Pikhurko, Helmut Veith, Oleg Verbitsky:
The first order definability of graphs: Upper bounds for quantifier depth. Discret. Appl. Math. 154(17): 2511-2529 (2006) - [j27]Oleg Pikhurko:
Dense edge-magic graphs and thin additive bases. Discret. Math. 306(17): 2097-2107 (2006) - [j26]Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits:
4-Books of three pages. J. Comb. Theory A 113(5): 882-891 (2006) - [j25]Oleg Pikhurko, Jerzy Wojciechowski:
Edge-bandwidth of grids and tori. Theor. Comput. Sci. 369(1-3): 35-43 (2006) - 2005
- [j24]Oleg Pikhurko, Anusch Taraz:
Degree Sequences of F-Free Graphs. Electron. J. Comb. 12 (2005) - [j23]Malgorzata Bednarska, Oleg Pikhurko:
Biased positional games on matroids. Eur. J. Comb. 26(2): 271-285 (2005) - [j22]Béla Bollobás, Oleg Pikhurko:
Integer sets with prescribed pairwise differences being distinct. Eur. J. Comb. 26(5): 607-616 (2005) - [j21]Catherine S. Greenhill, Oleg Pikhurko:
Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs. Graphs Comb. 21(4): 407-419 (2005) - [j20]Oleg Pikhurko, Oleg Verbitsky:
Descriptive complexity of finite structures: Saving the quantifier rank. J. Symb. Log. 70(2): 419-450 (2005) - [j19]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) - [j18]Oleg Pikhurko:
Generating Edge-Labeled Trees. Am. Math. Mon. 112(10): 919-921 (2005) - 2004
- [j17]Oleg Pikhurko:
Results and Open Problems on Minimum Saturated Hypergraphs. Ars Comb. 72 (2004) - 2003
- [j16]Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits:
The Tura'n Density of the Hypergraph {abc, ade, bde, cde}. Electron. J. Comb. 10 (2003) - [j15]Oleg Pikhurko:
Further asymptotic size Ramsey results obtained via linear programming. Discret. Math. 273(1-3): 193-202 (2003) - [j14]Oleg Pikhurko:
Size ramsey numbers of stars versus 4-chromatic graphs. J. Graph Theory 42(3): 220-233 (2003) - [j13]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) - [j12]Oleg Pikhurko:
Remarks on a paper by H. Bielak on size Ramsey numbers. Period. Math. Hung. 47(1-2): 195-200 (2003) - 2002
- [j11]Oleg Pikhurko, Andrew Thomason:
Disjoint subgraphs of large maximum degree. Discret. Math. 248(1-3): 125-141 (2002) - [j10]Oleg Pikhurko:
Asymptotic Size Ramsey Results for Bipartite Graphs. SIAM J. Discret. Math. 16(1): 99-113 (2002) - 2001
- [j9]Oleg Pikhurko:
Size Ramsey Numbers of Stars Versus 3-chromatic Graphs. Comb. 21(3): 403-412 (2001) - [j8]Oleg Pikhurko:
Size Ramsey Numbers and Integer Programming. Electron. Notes Discret. Math. 10: 242-244 (2001) - [j7]Oleg Pikhurko:
Uniform Families and Count Matroids. Graphs Comb. 17(4): 729-740 (2001) - 2000
- [j6]Oleg Pikhurko:
Asymptotic evaluation of the sat-function for r-stars. Discret. Math. 214(1-3): 275-278 (2000) - [j5]Oleg Pikhurko:
Size Ramsey Numbers Involving Large Stars. Electron. Notes Discret. Math. 5: 260-262 (2000) - [j4]Oleg Pikhurko:
On Envy-Free Cake Division. Am. Math. Mon. 107(8): 736-738 (2000)
1990 – 1999
- 1999
- [j3]Oleg Pikhurko:
The Minimum Size Of Saturated Hypergraphs. Comb. Probab. Comput. 8(5): 483-492 (1999) - [j2]Oleg Pikhurko:
Enumeration of Labelled (k, m)-Trees. J. Comb. Theory A 86(1): 197-199 (1999) - [j1]Oleg Pikhurko:
On Edge Decompositions of Posets. Order 16(3): 231-244 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 20:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
