{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:37:45Z","timestamp":1775054265255,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,2,7]],"date-time":"2018-02-07T00:00:00Z","timestamp":1517961600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s00493-017-3792-8","type":"journal-article","created":{"date-parts":[[2018,2,7]],"date-time":"2018-02-07T01:05:19Z","timestamp":1517965519000},"page":"153-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Size of K-Cross-Free Families"],"prefix":"10.1007","volume":"39","author":[{"given":"Andrey","family":"Kupavskii","sequence":"first","affiliation":[]},{"given":"J\u00e1nos","family":"Pach","sequence":"additional","affiliation":[]},{"given":"Istv\u00e1n","family":"Tomon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,7]]},"reference":[{"key":"3792_CR1","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s00454-009-9143-9","volume":"41","author":"E. Ackerman","year":"2009","unstructured":"E. Ackerman: On the maximum number of edges in topological graphs with no four pairwise crossing edges, Discrete Comput. Geom. 41 (2009), 365\u2013375.","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"3792_CR2","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/j.jcta.2006.08.002","volume":"114","author":"E. Ackerman","year":"2007","unstructured":"E. Ackerman and G. Tardos: On the maximum number of edges in quasi-planar graphs, J. Combin. Theory Ser. A 114 (2007), no. 3, 563\u2013571.","journal-title":"J. Combin. Theory Ser. A"},{"key":"3792_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01196127","volume":"17","author":"P. K. Agarwal","year":"1997","unstructured":"P. K. Agarwal, B. Aronov, J. Pach, R. Pollack and M. Sharir: Quasi-planar graphs have a linear number of edges, Combinatorica 17 (1997), 1\u20139.","journal-title":"Combinatorica"},{"key":"3792_CR4","volume-title":"Research Problems in Discrete Geometry","author":"P. Brass","year":"2005","unstructured":"P. Brass, W. Moser and J. Pach: Research Problems in Discrete Geometry, Springer-Verlag, New York, 2005."},{"key":"3792_CR5","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0095-8956(92)90003-G","volume":"56","author":"V. Capoyleas","year":"1992","unstructured":"V. Capoyleas and J. Pach: A Tur\u00e1n-type theorem on chords of a convex polygon, J. Comb. Theory, Ser. B 56 (1992), 9\u201315.","journal-title":"J. Comb. Theory, Ser. B"},{"key":"3792_CR6","first-page":"143","volume":"13","author":"B. V. Cherkasky","year":"1977","unstructured":"B. V. Cherkasky: A solution of a problem of multicommodity flows in a network, Ekonom.-Mat. Metody 13 (1977), 143\u2013151. (In Russian.)","journal-title":"Ekonom.-Mat. Metody"},{"key":"3792_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R. P. Dilworth","year":"1950","unstructured":"R. P. Dilworth: A decomposition theorem for partially ordered sets, Annals of Mathematics 51 (1950), 161\u2013166.","journal-title":"Annals of Mathematics"},{"key":"3792_CR8","volume-title":"Basic Phylogenetic Combinatorics","author":"A. W. M. Dress","year":"2012","unstructured":"A. W. M. Dress, K. T. Huber, J. H. Koolean, V. Moulton and A. Spillner: Basic Phylogenetic Combinatorics, Cambridge University Press 2012."},{"issue":"4","key":"3792_CR9","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s00026-004-0233-3","volume":"8","author":"A. W. M. Dress","year":"2005","unstructured":"A. W. M. Dress, J. H. Koolean and V. Moulton: 4n\u201410, Annals of Combinatorics 8 (4) (2005), 463\u2013471.","journal-title":"Annals of Combinatorics"},{"key":"3792_CR10","first-page":"185","volume-title":"Studies in Integer Programming (Proc. Workshop, Bonn, 1975), Ann. of Discrete Math., Vol. 1","author":"J. Edmonds","year":"1977","unstructured":"J. Edmonds and R. Giles: A min-max relation for submodular functions on graphs, in: Studies in Integer Programming (Proc. Workshop, Bonn, 1975), Ann. of Discrete Math., Vol. 1, North-Holland, Amsterdam, 1977, 185\u2013204."},{"key":"3792_CR11","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s004930100007","volume":"21","author":"T. Fleiner","year":"2001","unstructured":"T. Fleiner: The size of 3-cross-free families, Combinatorica 21 (2001), 445\u2013448.","journal-title":"Combinatorica"},{"key":"3792_CR12","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1137\/S0895480195287723","volume":"10","author":"A. Frank","year":"1997","unstructured":"A. Frank, A. V. Karzanov and A. Seb\u0151: On integer multi ow maximization, SIAM J. Discrete Math. 10 (1997), 158\u2013170.","journal-title":"SIAM J. Discrete Math."},{"key":"3792_CR13","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s12190-012-0546-z","volume":"40","author":"S. Gr\u00fcnewald","year":"2012","unstructured":"S. Gr\u00fcnewald, J. H. Koolen, V. Moulton and T. Wu: The size of 3-compatible, weakly compatible split systems, J. Appl. Math. Comput. 40 (2012), 249\u2013259.","journal-title":"J. Appl. Math. Comput."},{"key":"3792_CR14","unstructured":"A. V. Karzanov: Combinatorial Methods to Solve Cut-Determined Multi ow Problems, Combinatorial Methods for Flow Problems, no. 3 (A. V. Karzanov, editor), Vsesoyuz. Nauchno-Issled. Inst. Sistem Issled., Moscow, 1979, 6\u201369 (in Russian)."},{"key":"3792_CR15","unstructured":"A. V. Karzanov and M. V. Lomonosov: Flow systems in undirected networks, Mathematical Programming, (O. I. Larichev, ed.) Institute for System Studies, Moscow (1978), 59\u201366 (in Russian)."},{"key":"3792_CR16","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01902503","volume":"28","author":"L. Lov\u00e1sz","year":"1976","unstructured":"L. Lov\u00e1sz: On some connectivity properties of Eulerian graphs, Acta Mat. Akad. Sci. Hungaricae 28 (1976), 129\u2013138.","journal-title":"Acta Mat. Akad. Sci. Hungaricae"},{"key":"3792_CR17","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1090\/trans2\/158\/17","volume":"158","author":"P. A. Pevzner","year":"1994","unstructured":"P. A. Pevzner: Non-3-crossing families and multicommodity flows, Amer. Math. Soc. Transl. 158 (1994), 201\u2013206.","journal-title":"Amer. Math. Soc. Transl."},{"key":"3792_CR18","doi-asserted-by":"crossref","unstructured":"A. Suk: A note on K k,k-cross free families, Electron. J. Combin. 15 (2008), #N39.","DOI":"10.37236\/914"},{"key":"3792_CR19","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/PL00009364","volume":"19","author":"P. Valtr","year":"1998","unstructured":"P. Valtr: On geometric graphs with no k pairwise parallel edges, Discrete Comput. Geom. 19 (1998), 461\u2013469.","journal-title":"Discrete Comput. Geom."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-017-3792-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-017-3792-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-017-3792-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,27]],"date-time":"2020-10-27T19:34:35Z","timestamp":1603827275000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-017-3792-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,7]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["3792"],"URL":"https:\/\/doi.org\/10.1007\/s00493-017-3792-8","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,7]]},"assertion":[{"value":"7 April 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}