 Oleg Pikhurko
Assistant 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 including extremal graphs
and Ramsey theory.
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, first-order
formulas on graphs, and some questions from combinatorial number theory.
Selected Publications
The Minimum Size of Saturated Hypergraphs, Comb, Prob & Comp, 8 (1999)
483-492.
Weakly Saturated Hypergraphs and Exterior Algebra, Comb, Prob & Comp, 10
(2001) 435-451
Size Ramsey Numbers of Stars versus 3-Chromatic Graphs, Combinatorica, 21
(2001) 403-412.
(with A.Thomason) Disjoint Subgraphs of Large Maximum Degree, Discr Math,
248 (2002) 125-141.
(with Z.Furedi and M.Simonovits) The Turan Density of the Hypergraph
{abc,ade,bde,cde}, Electronic J Comb, 10 (2003) 7pp.
The complete list (with downloadable papers) is available at http://www.math.cmu.edu/~pikhurko/Papers/
|
