Disjoint edges in geometric graphs

N. Alon; P. Erdös

doi:10.1007/BF02187731

Disjoint edges in geometric graphs

N. Alon, P. Erdös

School of Computer Sciences

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

Abstract

Answering an old question in combinatorial geometry, we show that any configuration consisting of a set V of n points in general position in the plane and a set of 6 n - 5 closed straight line segments whose endpoints lie in V, contains three pairwise disjoint line segments.

Original language	English
Pages (from-to)	287-290
Number of pages	4
Journal	Discrete and Computational Geometry
Volume	4
Issue number	1
DOIs	https://doi.org/10.1007/BF02187731
State	Published - Dec 1989

Access to Document

10.1007/BF02187731

Cite this

@article{e5b5b1acbe9740f18a67824688f79d5e,

title = "Disjoint edges in geometric graphs",

abstract = "Answering an old question in combinatorial geometry, we show that any configuration consisting of a set V of n points in general position in the plane and a set of 6 n - 5 closed straight line segments whose endpoints lie in V, contains three pairwise disjoint line segments.",

author = "N. Alon and P. Erd{\"o}s",

year = "1989",

month = dec,

doi = "10.1007/BF02187731",

language = "אנגלית",

volume = "4",

pages = "287--290",

journal = "Discrete and Computational Geometry",

issn = "0179-5376",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - Disjoint edges in geometric graphs

AU - Alon, N.

AU - Erdös, P.

PY - 1989/12

Y1 - 1989/12

N2 - Answering an old question in combinatorial geometry, we show that any configuration consisting of a set V of n points in general position in the plane and a set of 6 n - 5 closed straight line segments whose endpoints lie in V, contains three pairwise disjoint line segments.

AB - Answering an old question in combinatorial geometry, we show that any configuration consisting of a set V of n points in general position in the plane and a set of 6 n - 5 closed straight line segments whose endpoints lie in V, contains three pairwise disjoint line segments.

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

U2 - 10.1007/BF02187731

DO - 10.1007/BF02187731

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

AN - SCOPUS:0040678070

VL - 4

SP - 287

EP - 290

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

SN - 0179-5376

IS - 1

ER -

Disjoint edges in geometric graphs

Abstract

Access to Document

Other files and links

Fingerprint

Cite this