A note on light geometric graphs
Name
Fox_A note on light geometric.pdf
Size
201.88 KB
Format
Adobe PDF
Checksum (MD5)
2eaf359c40a27b5d0379263f2cb08aa1
Author(s)
Ackerman, Eyal
Fox, Jacob
Pinchasi, Rom
Date Issued
March 2013
Journal
Discrete Mathematics
Publisher
Elsevier
Citation
Ackerman, Eyal, Jacob Fox, and Rom Pinchasi. “A Note on Light Geometric Graphs.” Discrete Mathematics 313, no. 12 (June 2013): 1281–1283.
Version
Author's final manuscript
Abstract
Let G be a geometric graph on n vertices in general position in the plane. We say that G is k-light if no edge e of G has the property that each of the two open half-planes bounded by the line through e contains more than k edges of G. We extend the previous result in Ackerman and Pinchasi (2012) [1] and with a shorter argument show that every k-light geometric graph on n vertices has at most O(n√k) edges. This bound is best possible.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-Noncommercial-NoDerivatives
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/j.disc.2013.03.001
