{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:02:59Z","timestamp":1725552179629},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540314257"},{"type":"electronic","value":"9783540316671"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11618058_25","type":"book-chapter","created":{"date-parts":[[2006,1,20]],"date-time":"2006-01-20T04:56:50Z","timestamp":1137733010000},"page":"274-284","source":"Crossref","is-referenced-by-count":2,"title":["On Edges Crossing Few Other Edges in Simple Topological Complete Graphs"],"prefix":"10.1007","author":[{"given":"Jan","family":"Kyn\u010dl","sequence":"first","affiliation":[]},{"given":"Pavel","family":"Valtr","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","first-page":"9","volume":"12","author":"M. Ajtai","year":"1982","unstructured":"Ajtai, M., Chv\u00e1tal, V., Newborn, M., Szemer\u00e9di, E.: Crossing-free subgraphs. Annals of Discrete Mathematics\u00a012, 9\u201312 (1982)","journal-title":"Annals of Discrete Mathematics"},{"key":"25_CR2","volume-title":"Research problems in discrete geometry","author":"P. Brass","year":"2005","unstructured":"Brass, P., Moser, W., Pach, J.: Research problems in discrete geometry. Springer, Heidelberg (2005)"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/PL00009495","volume":"23","author":"G. Cairns","year":"2000","unstructured":"Cairns, G., Nikolayevsky, Y.: Bounds for generalized thrackles. Discrete Comput. Geom.\u00a023, 191\u2013206 (2000)","journal-title":"Discrete Comput. Geom."},{"key":"25_CR4","unstructured":"\u010cern\u00fd, J.: Geometric graphs with no three disjoint edges. Discrete Comput. Geom. (to appear)"},{"key":"25_CR5","first-page":"539","volume":"18","author":"H. Harborth","year":"1978","unstructured":"Harborth, H.: Crossings on edges in drawings of complete multipartite graphs. Colloquia Math. Soc. J\u00e1nos Bolyai\u00a018, 539\u2013551 (1978)","journal-title":"Colloquia Math. Soc. J\u00e1nos Bolyai"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0095-8956(74)90035-5","volume":"17","author":"H. Harborth","year":"1974","unstructured":"Harborth, H., Mengersen, M.: Edges without crossings in drawings of complete graphs. J. Comb. Theory, Ser. B\u00a017, 299\u2013311 (1974)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"25_CR7","first-page":"225","volume":"88","author":"H. Harborth","year":"1992","unstructured":"Harborth, H., Mengersen, M.: Drawings of the complete graph with maximum number of crossings. Congr. Numerantium\u00a088, 225\u2013228 (1992)","journal-title":"Congr. Numerantium"},{"key":"25_CR8","first-page":"83","volume":"102","author":"H. Harborth","year":"1994","unstructured":"Harborth, H., Th\u00fcrmann, C.: Minimum number of edges with at most s crossings in drawings of the complete graph. Congr. Numerantium\u00a0102, 83\u201390 (1994)","journal-title":"Congr. Numerantium"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF01744433","volume":"17","author":"F.T. Leighton","year":"1984","unstructured":"Leighton, F.T.: New lower bound techniques for VLSI. Math. Systems Theory\u00a017, 47\u201370 (1984)","journal-title":"Math. Systems Theory"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-36151-0_28","volume-title":"Graph Drawing","author":"J. Pach","year":"2002","unstructured":"Pach, J., Pinchasi, R., Tardos, G., T\u00f3th, G.: Geometric graphs with no self-intersecting path of length three. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 295\u2013311. Springer, Heidelberg (2002); also European J. Combin. 25(6), 793\u2013811 (2004)"},{"key":"25_CR11","series-title":"Contemp. Math.","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1090\/conm\/342\/06141","volume-title":"Towards a theory of geometric graphs","author":"J. Pach","year":"2004","unstructured":"Pach, J., Radoi\u010di\u0107, R., T\u00f3th, G.: A generalization of quasi-planarity. In: Towards a theory of geometric graphs. Contemp. Math., vol.\u00a0342, pp. 177\u2013183. Amer. Math. Soc, Providence (2004)"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-540-44400-8_24","volume-title":"Discrete and Computational Geometry","author":"J. Pach","year":"2003","unstructured":"Pach, J., Radoi\u010di\u0107, R., T\u00f3th, G.: Relaxing planarity for topological graphs. In: Akiyama, J., Kano, M. (eds.) JCDCG 2002. LNCS, vol.\u00a02866, pp. 221\u2013232. Springer, Heidelberg (2003)"},{"key":"25_CR13","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s00454-003-0012-9","volume":"30","author":"J. Pach","year":"2003","unstructured":"Pach, J., Solymosi, J., T\u00f3th, G.: Unavoidable configurations in topological complete graphs. Discrete Comput. Geom.\u00a030, 311\u2013320 (2003)","journal-title":"Discrete Comput. Geom."},{"key":"25_CR14","unstructured":"Pach, J., T\u00f3th, G.: Disjoint edges in topological graphs (to appear)"},{"key":"25_CR15","series-title":"Contemp. Math.","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1090\/conm\/342\/06143","volume-title":"Towards a theory of geometric graphs","author":"R. Pinchasi","year":"2004","unstructured":"Pinchasi, R., Radoi\u010di\u0107, R.: Topological graphs with no self-intersecting cycle of length 4. In: Towards a theory of geometric graphs. Contemp. Math., vol.\u00a0342, pp. 233\u2013243. Amer. Math. Soc., Providence (2004)"},{"key":"25_CR16","unstructured":"Ringel, G.: Extremal problems in the theory of graphs. In: Theory Graphs Appl., Proc. Symp. Smolenice 1963, pp. 85\u201390 (1964)"},{"key":"25_CR17","first-page":"33","volume":"2","author":"R.D. Ringeisen","year":"1991","unstructured":"Ringeisen, R.D., Stueckle, S.K., Piazza, B.L.: Subgraphs and bounds on maximum crossings. Bull. Inst. Comb. Appl.\u00a02, 33\u201346 (1991)","journal-title":"Bull. Inst. Comb. Appl."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11618058_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:12:13Z","timestamp":1619493133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11618058_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314257","9783540316671"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11618058_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}