Bounded-degree graphs have arbitrarily large geometric thickness

Electronic Journal of Combinatorics

Volumn 13, Issue 1 R, 2006, Pages 1-14

  Barát, János ^a   Matoušek, Jiří ^b   Wood, David R ^c  

^a UNIVERSITY OF SZEGED   (Hungary)

^b CHARLES UNIVERSITY   (Czech Republic)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 30344438561     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/1029     Document Type: Article

References (36)

1. MIKLÓS AJTAI, VAŠEK CHVÁTAL, MONROE M. NEWBORN, AND ENDRE SZEMERÉDI. Crossing-free subgraphs. In Theory and practice of combinatorics, vol. 60 of North-Holland Math. Stud., pp. 9-12. North-Holland, 1982.
2. NOGA ALON. The number of polytopes, configurations and real matroids. Maihematika, 33(1):62-71, 1986.
3. GERGELY AMBRUS, JÁNOS BARÁT, AND PÉTER HAJNAL. The slope parameter of graphs. Tech. Rep. MAT-2005-07, Department of Mathematics, Technical University of Denmark, Lyngby, Denmark, 2005.
4. EDWARD A. BENDER AND E. RODNEY CANFIELD. The asymptotic number of labeled graphs with given degree sequences. J. Combin. Theory Ser. A, 24:296-307, 1978.
5. ROBIN BLANKENSHIP. Book Embeddings of Graphs. Ph.D. thesis, Department of Mathematics, Louisiana State University, U.S.A., 2003.
6. ROBIN BLANKENSHIP AND BOGDAN OPOROWSKI. Drawing subdivisions of complete and complete bipartite graphs on books. Tech. Rep. 1999-4, Department of Mathematics, Louisiana State University, U.S.A., 1999.
7. MICHAEL B. DILLENCOURT, DAVID EPPSTEIN, AND DANIEL S. HIRSCHBERG. Geometric thickness of complete graphs. J. Graph Algorithms Appl., 4(3):5-17, 2000.
8. VIDA DUJMOVIĆ, MATTHEW SUDERMAN, AND DAVID R. WOOD. Really straight graph drawings. In JÁNOS PACH, ed., Proc. 12th International Symp. on Graph Drawing (GD '04), vol. 3383 of Lecture Notes in Comput. Sci., pp. 122-132. Springer, 2004.
9. VIDA DUJMOVIĆ AND DAVID R. WOOD. On linear layouts of graphs. Discrete Math. Theor. Comput. Sci., 6(2):339-358, 2004.
10. VIDA DUJMOVIĆ AND DAVID R. WOOD. Graph treewidth and geometric thickness parameters. In PATRICK HEALY, ed., Proc. 13th International Symp. on Graph Drawing (GD '05), Lecture Notes in Comput. Sci., Springer, to appear, http://arxiv.org/math/0503553.
11. CHRISTIAN A. DUNCAN, DAVID EPPSTEIN, AND STEPHEN G. KOBOUROV. The geometric thickness of low degree graphs. In Proc. 20th ACM Symp. on Computational Geometry (SoCG '04), pp. 340-346. ACM Press, 2004.
12. DAVID EPPSTEIN. Separating geometric thickness from book thickness, 2001. http://arXiv.org/math/0109195.
13. DAVID EPPSTEIN. Separating thickness from geometric thickness. In JÁNOS PACH, ed., Towards a Theory of Geometric Graphs, vol. 342 of Contemporary Mathematics, pp. 75-86. Amer. Math. Soc., 2004.
14. JOHN H. HALTON. On the thickness of graphs of given degree. Inform. Sci., 54(3):219-238, 1991.
15. JOAN P. HUTCHINSON, THOMAS C. SHERMER, AND ANDREW VINCE. On representations of some thickness-two graphs. Comput. Geom., 13(3):161-171, 1999.
16. ROBERT E. JAMISON. Few slopes without collinearity. Discrete Math., 60:199-206, 1986.
17. STASYS JUKNA. Extremal combinatorics: with applications in computer science. Texts in Theoretical Computer Science. Springer, 2001. ISBN 3-540-66313-4.
18. PAUL C. KAINEN. Thickness and coarseness of graphs. Abh. Math. Sem. Univ. Hamburg, 39:88-95, 1973.
19. SETH M. MALITZ. Graphs with E edges have pagenumber O(√E). J. Algorithms, 17(1):71-84, 1994.
20. JIŘÍ MATOUŠEK. Lectures on Discrete Geometry, vol. 212 of Graduate Texts in Mathematics. Springer, 2002. ISBN 0-387-95373-6.
21. BRENDAN D. MCKAY. Asymptotics for symmetric 0-1 matrices with prescribed row sums. Ars Combin., 19(A):15-25, 1985.
22. JOHN MILNOR. On the Betti numbers of real varieties. Proc. Amer. Math. Soc., 15:275-280, 1964.
23. PETRA MUTZEL, THOMAS ODENTHAL, AND MARK SCHARBRODT. The thickness of graphs: a survey. Graphs Combin., 14(1):59-73, 1998.
24. JÁNOS PACK AND DÖMÖTÖR PÁLVÖLGYI. Bounded-degree graphs can have arbitrarily large slope numbers. Electron. J. Combin., 13:N1, 2006.
25. JÁNOS PACK AND REPHAEL WENGER. Embedding planar graphs at fixed vertex locations. Graphs Combin., 17(4):717-728, 2001.
26. IVAN G. PETROVSKIǏ AND OLGA A. OLEǏNIK. On the topology of real algebraic surfaces. Izvestiya Akad. Nauk SSSR. Ser. Mat., 13:389-402, 1949.
27. RICHARD POLLACK AND MARIE-FRANČOISE ROY. On the number of cells defined by a set of polynomials. C. R. Acad. Sci. Paris Sér. I Math., 316(6):573-577, 1993.
28. HERBERT ROBBINS. A remark on Stirling's formula. Amer. Math. Monthly, 62:26-29, 1955.
29. LAJOS RÓNYAI, LÁSZLÓ BABAI, AND MURALI K. GANAPATHY. On the number of zero-patterns of a sequence of polynomials. J. Amer. Math. Soc., 14(3):717-735, 2001.
30. FRANCISCO SANTOS AND RAIMUND SEIDEL. A better upper bound on the number of triangulations of a planar point set. J. Combin. Theory Ser. A, 102(1):186-193, 2003.
31. ONDREJ SÝKORA, LÁSZLÓ A. SZÉKELY, AND IMRICH VRŤO. A note on Halton's conjecture. Inform. Sci., 164(1-4):61-64, 2004.
32. RENÉ THOM. Sur l'homologie des variétés algébriques réelles. In S. S. CAIRNS, ed., Differential and Combinatorial Topology, pp. 255-265. Princeton Univ. Press, 1965.
33. GREG A. WADE AND JIANG-HSING CHU. Drawability of complete graphs using a minimal slope set. The Computer Journal, 37(2):139-142, 1994.
34. HUGH E. WARREN. Lower bounds for approximation by nonlinear manifolds. Trans. Amer. Math. Soc., 133:167-178, 1968.
35. WALTER WESSEL. Über die Abhängigkeit der Dicke eines Graphen von seinen Knotenpunktvalenzen. In 2nd Colloquium for Geometry and Combinatorics, pp. 235-238. Tech. Hochschule Karl-Marx-Stadt, 1983.
36. NICHOLAS WORMALD. Some problems in the enumeration of labelled graphs. Ph.D. thesis, Newcastle-upon-Tyne, United Kingdom, 1978.