On the maximum number of edges in quasi-planar graphs

Journal of Combinatorial Theory. Series A

Volumn 114, Issue 3, 2007, Pages 563-571

  Ackerman, Eyal ^a   Tardos, Gábor ^b,c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b SIMON FRASER UNIVERSITY   (Canada)

^c ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

Author keywords

Discharging method; Geometric graphs; Quasi planar graphs; Topological graphs; Tur n type problems

Indexed keywords

EID: 33846817022     PISSN: 00973165     EISSN: 10960899     Source Type: Journal    
DOI: 10.1016/j.jcta.2006.08.002     Document Type: Article

References (14)

1. E. Ackerman, On the maximum number of edges in topological graphs with no four pairwise crossing edges, in: Proc. 22nd ACM Symp. on Computational Geometry, Sedona, AZ, June 2006, pp. 259-263
2. Agarwal P.K., Aronov B., Pach J., Pollack R., and Sharir M. Quasi-planar graphs have a linear number of edges. Combinatorica 17 1 (1997) 1-9
3. Appel K., and Haken W. Every planar map is four colorable. Part I. Discharging. Illinois J. Math. 21 (1997) 429-490
4. O. Aichholzer, H. Krasser, The point set order type data base: A collection of applications and results, in: Proc. 13th Canadian Conf. on Computational Geometry, Waterloo, Ontario, Canada, August 2001, pp. 17-20
5. Capoyleas V., and Pach J. A Turán-type problem on chords of a convex polygon. J. Combin. Theory Ser. B 56 1 (1992) 9-15
6. Pach J. Notes on geometric graph theory. In: Goodman J.E., Pollack R., and Steiger W. (Eds). Discrete and Computational Geometry: Papers from DIMACS Special Year. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. vol. 6 (1991), Amer. Math. Soc., Providence, RI 273-285
7. Pach J. Geometric graph theory. In: Goodman J., and O'Rourke J. (Eds). Handbook of Discrete and Computational Geometry. second ed. (2004), CRC Press, Boca Raton 219-238
8. Pach J., Pinchasi R., Sharir M., and Tóth G. Topological graphs with no large grids. Graphs Combin. 21 3 (2005) 264-355
9. Pach J., Radoičić R., and Tóth G. Relaxing planarity for topological graphs. In: Akiyama J., and Kano M. (Eds). JCDCG 2002. Lecture Notes in Comput. Sci. vol. 2866 (2003), Springer 221-232
10. Pach J., Radoičić R., and Tóth G. A generalization of quasi-planarity. In: Pach J. (Ed). Towards a Theory of Geometric Graphs. Contemp. Math. (2004), Amer. Math. Soc., Providence, RI 177-183
11. Pach J., and Tóth G. Graphs drawn with few crossings per edge. Combinatorica 17 3 (1997) 427-439
12. G. Tardos, Construction of locally plane graphs, SIAM J. Discrete Math., in press
13. Tardos G., and Tóth G. Crossing stars in topological graphs. In: Akiyama J., Kano M., and Tan X. (Eds). JCDCG 2004. Lecture Notes in Comput. Sci. vol. 3742 (2005), Springer 184-197
14. Valtr P. Graph drawings with no k pairwise crossing edges. In: Battista G.D. (Ed). Graph Drawing. Lecture Notes in Comput. Sci. vol. 1353 (1997), Springer 205-218