Geodesic
Disjoint Edges in Geometric Graphs.
Discrete & computational geometry, Tome 4 (1989) no. 6, pp. 287-290
Cet article a éte moissonné depuis la source European Digital Mathematics Library

Voir la notice de l'article

Mots-clés : combinatorial geometry, configuration, three pairwise disjoint line segments 
@article{DCG_1989__4_6_131080,
     author = {P. Erd\"os and N. Alon},
     title = {Disjoint {Edges} in {Geometric} {Graphs.}},
     journal = {Discrete & computational geometry},
     pages = {287--290},
     year = {1989},
     volume = {4},
     number = {6},
     zbl = {0692.05037},
     url = {http://geodesic.mathdoc.fr/item/DCG_1989__4_6_131080/}
}
TY  - JOUR
AU  - P. Erdös
AU  - N. Alon
TI  - Disjoint Edges in Geometric Graphs.
JO  - Discrete & computational geometry
PY  - 1989
SP  - 287
EP  - 290
VL  - 4
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/DCG_1989__4_6_131080/
ID  - DCG_1989__4_6_131080
ER  - 
%0 Journal Article
%A P. Erdös
%A N. Alon
%T Disjoint Edges in Geometric Graphs.
%J Discrete & computational geometry
%D 1989
%P 287-290
%V 4
%N 6
%U http://geodesic.mathdoc.fr/item/DCG_1989__4_6_131080/
%F DCG_1989__4_6_131080
P. Erdös; N. Alon. Disjoint Edges in Geometric Graphs.. Discrete & computational geometry, Tome 4 (1989) no. 6, pp. 287-290. http://geodesic.mathdoc.fr/item/DCG_1989__4_6_131080/