Many touchings force many crossings
暂无分享,去创建一个
[1] János Pach,et al. How Many Ways Can One Draw A Graph? , 2006, Comb..
[2] E. Szemerédi,et al. Crossing-Free Subgraphs , 1982 .
[3] László A. Székely,et al. Crossing Numbers and Hard Erdős Problems in Discrete Geometry , 1997, Combinatorics, Probability and Computing.
[4] Csaba D. Tóth,et al. Distinct Distances in the Plane , 2001, Discret. Comput. Geom..
[5] Micha Sharir. The Clarkson-Shor Technique Revisited And Extended , 2003, Comb. Probab. Comput..
[6] Tamal K. Dey,et al. Improved Bounds for Planar k -Sets and Related Problems , 1998, Discret. Comput. Geom..
[7] Joshua Zahl,et al. New bounds on curve tangencies and orthogonalities , 2015, ArXiv.
[8] F. Thomas Leighton,et al. Complexity Issues in VLSI , 1983 .
[9] János Pach,et al. Crossings between Curves with Many Tangencies , 2010, WALCOM.
[10] János Pach,et al. Beyond the Richter-Thomassen Conjecture , 2016, SODA.
[11] János Pach,et al. A Separator Theorem for String Graphs and its Applications , 2009, Combinatorics, Probability and Computing.
[12] W. T. Tutte. Toward a theory of crossing numbers , 1970 .
[13] Marc Noy,et al. Lower bounds on the number of crossing-free subgraphs of KN , 2000, Comput. Geom..