The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges

Eyal Ackerman; Noa Nitzan; Rom Pinchasi

doi:10.1007/s00373-013-1335-7

The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges

Eyal Ackerman, Noa Nitzan^*, Rom Pinchasi

^*Corresponding author for this work

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

1 Scopus citations

Abstract

Let G be a geometric graph on n vertices that are not necessarily in general position. Assume that no line passing through one edge of G meets the relative interior of another edge. We show that in this case the number of edges in G is at most 2n-3.

Original language	English
Pages (from-to)	1065-1072
Number of pages	8
Journal	Graphs and Combinatorics
Volume	30
Issue number	5
DOIs	https://doi.org/10.1007/s00373-013-1335-7
State	Published - Sep 2014
Externally published	Yes

Bibliographical note

Funding Information:
Supported by ISF grant (Grant No. 1357/12) and by BSF grant (Grant No. 2008290).

Keywords

Avoiding edges
Discharging method
Geometric graph
Parallel edges

Access to Document

10.1007/s00373-013-1335-7

Cite this

@article{6d249d629a9145e58e9cdfa9c6760da9,

title = "The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges",

abstract = "Let G be a geometric graph on n vertices that are not necessarily in general position. Assume that no line passing through one edge of G meets the relative interior of another edge. We show that in this case the number of edges in G is at most 2n-3.",

keywords = "Avoiding edges, Discharging method, Geometric graph, Parallel edges",

author = "Eyal Ackerman and Noa Nitzan and Rom Pinchasi",

note = "Funding Information: Supported by ISF grant (Grant No. 1357/12) and by BSF grant (Grant No. 2008290).",

year = "2014",

month = sep,

doi = "10.1007/s00373-013-1335-7",

language = "אנגלית",

volume = "30",

pages = "1065--1072",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "5",

}

TY - JOUR

T1 - The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges

AU - Ackerman, Eyal

AU - Nitzan, Noa

AU - Pinchasi, Rom

N1 - Funding Information: Supported by ISF grant (Grant No. 1357/12) and by BSF grant (Grant No. 2008290).

PY - 2014/9

Y1 - 2014/9

N2 - Let G be a geometric graph on n vertices that are not necessarily in general position. Assume that no line passing through one edge of G meets the relative interior of another edge. We show that in this case the number of edges in G is at most 2n-3.

AB - Let G be a geometric graph on n vertices that are not necessarily in general position. Assume that no line passing through one edge of G meets the relative interior of another edge. We show that in this case the number of edges in G is at most 2n-3.

KW - Avoiding edges

KW - Discharging method

KW - Geometric graph

KW - Parallel edges

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

U2 - 10.1007/s00373-013-1335-7

DO - 10.1007/s00373-013-1335-7

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84906344090

SN - 0911-0119

VL - 30

SP - 1065

EP - 1072

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 5

ER -

The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this