{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T18:39:22Z","timestamp":1773254362930,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>The  best lower bound known on the crossing number of the complete bipartite graph is : $$cr(K_{m,n}) \\geq (1\/5)(m)(m-1)\\lfloor n\/2 \\rfloor \\lfloor(n-1)\/2\\rfloor$$ In this paper we prove that: $$cr(K_{m,n}) \\geq (1\/5)m(m-1)\\lfloor n\/2 \\rfloor \\lfloor (n-1)\/2 \\rfloor + 9.9 \\times 10^{-6} m^2n^2$$ for sufficiently large $m$ and $n$.<\/jats:p>","DOI":"10.37236\/1748","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T07:03:36Z","timestamp":1578639816000},"source":"Crossref","is-referenced-by-count":9,"title":["On the Crossing Number of $K_{m,n}$"],"prefix":"10.37236","volume":"10","author":[{"given":"Nagi H.","family":"Nahas","sequence":"first","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2003,8,21]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v10i1n8\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v10i1n8\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T05:07:13Z","timestamp":1579324033000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v10i1n8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8,21]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2003,1,6]]}},"URL":"https:\/\/doi.org\/10.37236\/1748","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,8,21]]},"article-number":"N8"}}