Blumenthal, Adam; Lidický, Bernard; Pehova, Yanitsa; Pfender, Florian; Pikhurko, Oleg; Volec, Jan Sharp bounds for decomposing graphs into edges and triangles. (English) Zbl 1466.05176 Comb. Probab. Comput. 30, No. 2, 271-287 (2020). MSC: 05C70 05C35 PDFBibTeX XMLCite \textit{A. Blumenthal} et al., Comb. Probab. Comput. 30, No. 2, 271--287 (2020; Zbl 1466.05176) Full Text: DOI arXiv
Bennett, Patrick; Dudek, Andrzej; Lidický, Bernard; Pikhurko, Oleg Minimizing the number of 5-cycles in graphs with given edge-density. (English) Zbl 1436.05045 Comb. Probab. Comput. 29, No. 1, 44-67 (2020). MSC: 05C30 05C38 05C35 PDFBibTeX XMLCite \textit{P. Bennett} et al., Comb. Probab. Comput. 29, No. 1, 44--67 (2020; Zbl 1436.05045) Full Text: DOI arXiv
Pikhurko, Oleg; Razborov, Alexander Asymptotic structure of graphs with the minimum number of triangles. (English) Zbl 1371.05147 Comb. Probab. Comput. 26, No. 1, 138-160 (2017). MSC: 05C35 PDFBibTeX XMLCite \textit{O. Pikhurko} and \textit{A. Razborov}, Comb. Probab. Comput. 26, No. 1, 138--160 (2017; Zbl 1371.05147) Full Text: DOI arXiv
Balogh, József; Hu, Ping; Lidický, Bernard; Pikhurko, Oleg; Udvari, Balázs; Volec, Jan Minimum number of monotone subsequences of length 4 in permutations. (English) Zbl 1371.05137 Comb. Probab. Comput. 24, No. 4, 658-679 (2015). MSC: 05C35 05D99 05A05 PDFBibTeX XMLCite \textit{J. Balogh} et al., Comb. Probab. Comput. 24, No. 4, 658--679 (2015; Zbl 1371.05137) Full Text: DOI arXiv
Pikhurko, Oleg; Vaughan, Emil R. Minimum number of \(k\)-cliques in graphs with bounded independence number. (English) Zbl 1282.05183 Comb. Probab. Comput. 22, No. 6, 910-934 (2013). MSC: 05C69 05C35 90C35 PDFBibTeX XMLCite \textit{O. Pikhurko} and \textit{E. R. Vaughan}, Comb. Probab. Comput. 22, No. 6, 910--934 (2013; Zbl 1282.05183) Full Text: DOI arXiv
Pikhurko, Oleg Finding an unknown acyclic orientation of a given graph. (English) Zbl 1209.05113 Comb. Probab. Comput. 19, No. 1, 121-131 (2010). MSC: 05C20 05C35 05C38 PDFBibTeX XMLCite \textit{O. Pikhurko}, Comb. Probab. Comput. 19, No. 1, 121--131 (2010; Zbl 1209.05113) Full Text: DOI arXiv
Bohman, Tom; Frieze, Alan; Łuczak, Tomasz; Pikhurko, Oleg; Smyth, Clifford; Spencer, Joel; Verbitsky, Oleg First-order definability of trees and sparse random graphs. (English) Zbl 1119.03025 Comb. Probab. Comput. 16, No. 3, 375-400 (2007). MSC: 03C13 03C40 05C80 05C05 68Q19 PDFBibTeX XMLCite \textit{T. Bohman} et al., Comb. Probab. Comput. 16, No. 3, 375--400 (2007; Zbl 1119.03025) Full Text: DOI arXiv
Füredi, Zoltán; Pikhurko, Oleg; Simonovits, Miklós On triple systems with independent neighbourhoods. (English) Zbl 1079.05062 Comb. Probab. Comput. 14, No. 5-6, 795-813 (2005). Reviewer: William G. Brown (Montréal) MSC: 05C65 05C35 05D05 05C15 PDFBibTeX XMLCite \textit{Z. Füredi} et al., Comb. Probab. Comput. 14, No. 5--6, 795--813 (2005; Zbl 1079.05062) Full Text: DOI
Frieze, Alan; Krivelevich, Michael; Pikhurko, Oleg; Szabó, Tibor The game of JumbleG. (English) Zbl 1169.91321 Comb. Probab. Comput. 14, No. 5-6, 783-793 (2005). MSC: 91A43 PDFBibTeX XMLCite \textit{A. Frieze} et al., Comb. Probab. Comput. 14, No. 5--6, 783--793 (2005; Zbl 1169.91321) Full Text: DOI
Pikhurko, Oleg Weakly saturated hypergraphs and exterior algebra. (English) Zbl 1002.05053 Comb. Probab. Comput. 10, No. 5, 435-451 (2001). MSC: 05C65 15A75 05B35 PDFBibTeX XMLCite \textit{O. Pikhurko}, Comb. Probab. Comput. 10, No. 5, 435--451 (2001; Zbl 1002.05053) Full Text: DOI
Pikhurko, Oleg The minimum size of saturated hypergraphs. (English) Zbl 0938.05035 Comb. Probab. Comput. 8, No. 5, 483-492 (1999). Reviewer: J.W.Moon (Edmonton) MSC: 05C35 05C65 PDFBibTeX XMLCite \textit{O. Pikhurko}, Comb. Probab. Comput. 8, No. 5, 483--492 (1999; Zbl 0938.05035) Full Text: DOI