Skip to main content
Article thumbnail
Location of Repository

The Number of Crossings in a Regular Drawing of the Complete Bipartite Graph

By Stéphane Legendre


The regular drawing of the complete bipartite graph Kn,n produces a striking pattern comprising simple and multiple crossings. We compute the number c(n) of crossings and give an asymptotic estimate for this sequence

Year: 2009
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.