Oleg Pikhurko

Associate Professor
Ph.D., Cambridge University

Office: Wean Hall 6305
Phone: (412) 268-9827
E-mail: pikhurko@andrew.cmu.edu
Personal web site

Research

I work in various areas of discrete mathematics, in particular extremal problems for graphs and hypergraphs.

I find it always fascinating when the ideas and techniques from other areas (such as, for example, linear algebra or Fourier analysis) apply to combinatorial problems and vice versa. One of such powerfull tools, which interests me very much, is the probabilistic method.

My recent projects deal with the hypergraph Turan problem, Ramsey-type questions, and graph limits.

Selected Publications

Asymptotic Size Ramsey Results for Bipartite Graphs, SIAM J Discr Math, 16 (2003) 99-113.

(with J.H.Kim, J.Spencer and O.Verbitsky) How Complex are Random Graphs in First Order Logic?, Random Struc Alg, 26 (2005) 119-145.

(with Z.Furedi and M.Simonovits) 4-Books of Three Pages, J Comb Th (A), 113 (2006) 882-891.

(with Z.Furedi and D.Mubayi) Quadruple Systems with Independent Neighborhoods, J Comb Th (A), 115 (2008) 1552-1560.

An Exact Turan Result for the Generalized Triangle, Combinatorica, 28 (2008) 187-208.

The complete list (with downloadable papers) is available at http://www.math.cmu.edu/~pikhurko/Papers/