Abstract
The crossing number of a graph G is the minimum number of edge-crossings over all drawings of G in the plane. Determining the crossing number of a graph is a well-known problem in combinatorics. One of its most studied variants is to restrict the minimum to all drawings of G whose edges are straight line segments. This minimum is known as the geometric crossing number of G. We determine the exact crossing number of centrally symmetric geometric drawings of the complete graph.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
