Geodesic
Bounded-degree graphs can have arbitrarily large slope numbers
The electronic journal of combinatorics, Tome 13 (2006)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
We construct graphs with $n$ vertices of maximum degree $5$ whose every straight-line drawing in the plane uses edges of at least $n^{1/6-o(1)}$ distinct slopes.
DOI : 10.37236/1139
Classification : 05C62, 05C10
Mots-clés : straight-line drawing of graphs, geometric graphs, slope number of graphs, slope number 
János Pach; Dömötör Pálvölgyi. Bounded-degree graphs can have arbitrarily large slope numbers. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1139
@article{10_37236_1139,
     author = {J\'anos Pach and D\"om\"ot\"or P\'alv\"olgyi},
     title = {Bounded-degree graphs can have arbitrarily large slope numbers},
     journal = {The electronic journal of combinatorics},
     year = {2006},
     volume = {13},
     doi = {10.37236/1139},
     zbl = {1080.05064},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1139/}
}
TY  - JOUR
AU  - János Pach
AU  - Dömötör Pálvölgyi
TI  - Bounded-degree graphs can have arbitrarily large slope numbers
JO  - The electronic journal of combinatorics
PY  - 2006
VL  - 13
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1139/
DO  - 10.37236/1139
ID  - 10_37236_1139
ER  - 
%0 Journal Article
%A János Pach
%A Dömötör Pálvölgyi
%T Bounded-degree graphs can have arbitrarily large slope numbers
%J The electronic journal of combinatorics
%D 2006
%V 13
%U http://geodesic.mathdoc.fr/articles/10.37236/1139/
%R 10.37236/1139
%F 10_37236_1139

Cité par Sources :