Improved lower bounds on book crossing numbers of complete graphs
A book with k pages consists of a straight line (the spine) and k half-planes (the pages), such that the boundary of each page is the spine. If a graph is drawn on a book with k pages in such a way that the vertices lie on the spine, and each edge is contained in a page, the result is a k-page bo...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2014
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/101539 http://hdl.handle.net/10220/18655 |
| _version_ | 1824454987825020928 |
|---|---|
| author | Salazar, G. Pasechnik, Dmitrii V. De Klerk, Etienne. |
| author2 | School of Physical and Mathematical Sciences |
| author_facet | School of Physical and Mathematical Sciences Salazar, G. Pasechnik, Dmitrii V. De Klerk, Etienne. |
| author_sort | Salazar, G. |
| collection | NTU |
| description | A book with k pages consists of a straight line (the spine) and k half-planes (the
pages), such that the boundary of each page is the spine. If a graph is drawn on a book with k pages
in such a way that the vertices lie on the spine, and each edge is contained in a page, the result is
a k-page book drawing (or simply a k-page drawing). The k-page crossing number νk(G) of a graph
G is the minimum number of crossings in a k-page drawing of G. In this paper we investigate the
k-page crossing numbers of complete graphs. We use semidefinite programming techniques to give
improved lower bounds on νk(Kn) for various values of k. We also use a maximum satisfiability
reformulation to obtain a computer-aided calculation of the exact value of νk(Kn) for several values
of k and n. Finally, we investigate the best construction known for drawing Kn in k pages, calculate
the resulting number of crossings, and discuss this upper bound in light of the new results reported
in this paper. |
| first_indexed | 2025-02-19T03:31:03Z |
| format | Journal Article |
| id | ntu-10356/101539 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2025-02-19T03:31:03Z |
| publishDate | 2014 |
| record_format | dspace |
| spelling | ntu-10356/1015392023-02-28T19:42:12Z Improved lower bounds on book crossing numbers of complete graphs Salazar, G. Pasechnik, Dmitrii V. De Klerk, Etienne. School of Physical and Mathematical Sciences DRNTU::Science::Mathematics::Discrete mathematics A book with k pages consists of a straight line (the spine) and k half-planes (the pages), such that the boundary of each page is the spine. If a graph is drawn on a book with k pages in such a way that the vertices lie on the spine, and each edge is contained in a page, the result is a k-page book drawing (or simply a k-page drawing). The k-page crossing number νk(G) of a graph G is the minimum number of crossings in a k-page drawing of G. In this paper we investigate the k-page crossing numbers of complete graphs. We use semidefinite programming techniques to give improved lower bounds on νk(Kn) for various values of k. We also use a maximum satisfiability reformulation to obtain a computer-aided calculation of the exact value of νk(Kn) for several values of k and n. Finally, we investigate the best construction known for drawing Kn in k pages, calculate the resulting number of crossings, and discuss this upper bound in light of the new results reported in this paper. Published version 2014-01-21T08:05:19Z 2019-12-06T20:40:12Z 2014-01-21T08:05:19Z 2019-12-06T20:40:12Z 2013 2013 Journal Article De Klerk, E., Pasechnik, D. V., & Salazar, G. (2013). Improved lower bounds on book crossing numbers of complete graphs. SIAM journal on discrete mathematics, 27(2), 619-633. https://hdl.handle.net/10356/101539 http://hdl.handle.net/10220/18655 10.1137/120886777 en SIAM journal on discrete mathematics © 2013 Society for Industrial and Applied Mathematics. This paper was published in SIAM Journal on Discrete Mathematics and is made available as an electronic reprint (preprint) with permission of Society for Industrial and Applied Mathematics. The paper can be found at the following official DOI: [http://dx.doi.org/10.1137/120886777]. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper is prohibited and is subject to penalties under law. application/pdf |
| spellingShingle | DRNTU::Science::Mathematics::Discrete mathematics Salazar, G. Pasechnik, Dmitrii V. De Klerk, Etienne. Improved lower bounds on book crossing numbers of complete graphs |
| title | Improved lower bounds on book crossing numbers of complete graphs |
| title_full | Improved lower bounds on book crossing numbers of complete graphs |
| title_fullStr | Improved lower bounds on book crossing numbers of complete graphs |
| title_full_unstemmed | Improved lower bounds on book crossing numbers of complete graphs |
| title_short | Improved lower bounds on book crossing numbers of complete graphs |
| title_sort | improved lower bounds on book crossing numbers of complete graphs |
| topic | DRNTU::Science::Mathematics::Discrete mathematics |
| url | https://hdl.handle.net/10356/101539 http://hdl.handle.net/10220/18655 |
| work_keys_str_mv | AT salazarg improvedlowerboundsonbookcrossingnumbersofcompletegraphs AT pasechnikdmitriiv improvedlowerboundsonbookcrossingnumbersofcompletegraphs AT deklerketienne improvedlowerboundsonbookcrossingnumbersofcompletegraphs |