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