3 citations · 5 across the 6 of their papers we have counts for
Showing 2001Show all
3 papers · 1 filter
math.GM2001
Testing the Existence of a Supporting Plane
Oleg Pikhurko
We present an algorithm testing wheather, for given four vectors in R^3, there is a plane through the origin such that all four vectors fall into the same open halfspace.
math.CO2001
Remarks on a Paper by Y.Caro and R.Yuster on Turan Problem
Oleg Pikhurko
Caro and Yuster (Electronic J.Comb 7 (2000)) studied a generalization of the Turan problem, where a certain function (instead of the size) of an F-free graph of order n has to be m…
math.CO2001
Asymptotic Size Ramsey Results for Bipartite Graphs
Oleg Pikhurko
We investigate size Ramsey numbers involving bipartite graphs. It is proved that, if each forbidden graph is fixed or grows with n (in a certain uniform manner), then the extremal…