On the light side of geometric graphs

Eyal Ackerman; Rom Pinchasi

doi:10.1016/j.disc.2011.12.009

On the light side of geometric graphs

Eyal Ackerman, Rom Pinchasi

University of Haifa, Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

Let G be a geometric graph on n vertices in general position in the plane. Suppose that for every line ℓ in the plane the subgraph of G induced by the set of vertices in one of the two half-planes bounded by ℓ has at most k edges (k<1 may be a function of n). Then G has at most O(nk) edges. This bound is best possible.

Original language	American English
Pages (from-to)	1213-1217
Number of pages	5
Journal	Discrete Mathematics
Volume	312
Issue number	6
DOIs	https://doi.org/10.1016/j.disc.2011.12.009
State	Published - 28 Mar 2012

Keywords

Geometric graphs
k-near bipartite

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2011.12.009

Cite this

@article{7d8af69c381844f3b13e2b4803c5e020,

title = "On the light side of geometric graphs",

abstract = "Let G be a geometric graph on n vertices in general position in the plane. Suppose that for every line ℓ in the plane the subgraph of G induced by the set of vertices in one of the two half-planes bounded by ℓ has at most k edges (k<1 may be a function of n). Then G has at most O(nk) edges. This bound is best possible.",

keywords = "Geometric graphs, k-near bipartite",

author = "Eyal Ackerman and Rom Pinchasi",

note = "Funding Information: We thank anonymous referees for several helpful suggestions for improving the presentation of the paper. The second author was supported by BSF grant (grant No. 2008290 ).",

year = "2012",

month = mar,

day = "28",

doi = "10.1016/j.disc.2011.12.009",

language = "American English",

volume = "312",

pages = "1213--1217",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "6",

}

TY - JOUR

T1 - On the light side of geometric graphs

AU - Ackerman, Eyal

AU - Pinchasi, Rom

N1 - Funding Information: We thank anonymous referees for several helpful suggestions for improving the presentation of the paper. The second author was supported by BSF grant (grant No. 2008290 ).

PY - 2012/3/28

Y1 - 2012/3/28

N2 - Let G be a geometric graph on n vertices in general position in the plane. Suppose that for every line ℓ in the plane the subgraph of G induced by the set of vertices in one of the two half-planes bounded by ℓ has at most k edges (k<1 may be a function of n). Then G has at most O(nk) edges. This bound is best possible.

AB - Let G be a geometric graph on n vertices in general position in the plane. Suppose that for every line ℓ in the plane the subgraph of G induced by the set of vertices in one of the two half-planes bounded by ℓ has at most k edges (k<1 may be a function of n). Then G has at most O(nk) edges. This bound is best possible.

KW - Geometric graphs

KW - k-near bipartite

UR - http://www.scopus.com/inward/record.url?scp=84855247926&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2011.12.009

DO - 10.1016/j.disc.2011.12.009

M3 - Article

SN - 0012-365X

VL - 312

SP - 1213

EP - 1217

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 6

ER -

On the light side of geometric graphs

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this