Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

COMPGEOM
1989
ACM

favoriteEmaildiscussreport

78views Discrete Geometry» more COMPGEOM 1989»

On the Number of Halving Planes

13 years 9 months ago

On the Number of Halving Planes

Download www.math.uiuc.edu

Imre Bárány, Zoltán Füre

Real-time Traffic

COMPGEOM 1989 | Discrete Geometry |

claim paper

Related Content

» The maximum number of halving lines and the rectilinear crossing number of Kn for n

» kSets in Four Dimensions

» Halving lines and measure concentration in the plane

» On the Number of Arrangements of Pseudolines

» An Improved Bound for kSets in Four Dimensions

» Balanced lines halving triangles and the generalized lower bound theorem

» A note concerning the closest point pair algorithm

» Sparse halves in trianglefree graphs

» Polyploids genome halving and phylogeny

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1989
Where	COMPGEOM
Authors	Imre Bárány, Zoltán Füredi, László Lovász

Comments (0)