Calculating Crossing Numbers of Graphs Using Combinatorial Principles

<div>Two drawings of <span class="nowrap"><svg height="14.5707pt" id="M385" style="vertical-align:-5.28237pt" version="1.1" viewbox="-0.0498162 -9.28833 61.7491 14.5707" width="61.7491pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M360 -163L167 270L360 703H298L106 273V267L298 -163H360Z"></path></g><g transform="matrix(.013,0,0,-0.013,5.369,0)"><path d="M743 650H503L496 622L527 618C563 613 564 603 532 573C449 495 371 431 323 392C301 374 272 355 246 346L280 522C297 609 300 614 379 622L385 650H135L129 622C209 614 215 609 198 522L124 133C106 39 99 35 23 28L17 0H271L277 28C193 35 192 39 208 133L239 316C264 328 280 325 303 288C368 183 435 90 502 0H652L659 28C602 34 584 43 543 94C495 154 403 283 347 369L574 554C634 603 659 612 735 624L743 650Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,14.599,3.132)"><path d="M414 144C384 79 371 75 317 75H135L276 221C367 316 408 376 408 465C408 570 327 635 237 635C179 635 131 609 100 575L42 494L67 471C94 510 138 565 205 565C277 565 321 517 321 435C321 348 258 270 195 195C146 137 88 81 33 26V0H411C423 44 433 88 446 135L414 144Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,19.031,3.132)"><path d="M98 134C72 134 46 117 46 90C46 73 55 65 60 64C95 55 124 32 124 -4C124 -42 95 -68 44 -89L57 -123C122 -104 194 -60 194 22C194 94 136 134 98 134Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,21.187,3.132)"><path d="M290 377C321 398 342 415 358 430C378 450 389 473 389 502C389 578 329 635 238 635H237C184 635 137 610 109 578L64 515L88 493C112 529 154 573 208 573S303 542 303 482C303 409 233 370 141 341L149 308C165 313 190 319 215 319C272 319 341 283 341 193C342 98 292 43 222 43C163 43 122 72 96 94C88 101 79 100 70 94C61 87 47 73 46 60C44 47 48 37 62 23C76 10 118 -12 165 -12C238 -12 430 62 430 223C430 297 379 359 290 375V377Z"></path></g><g transform="matrix(.013,0,0,-0.013,29.064,0)"><path d="M535 194V548H477V194C477 102 391 35 294 35S111 102 111 194V548H53V194C53 72 166 -15 294 -15S535 72 535 194Z"></path></g><g transform="matrix(.013,0,0,-0.013,39.6,0)"><path d="M593 650H142L136 622C219 616 224 611 209 531L130 120C114 39 108 34 23 28L17 0H501C518 32 557 130 568 158L540 169C519 132 495 93 469 70C439 43 409 35 332 35C272 35 241 37 225 50C211 61 211 89 222 149L253 320H350C441 320 443 312 441 239H471L510 434H481C455 366 448 358 360 358H260L303 572C311 613 312 615 348 615H431C509 615 522 603 532 581C544 555 546 531 545 491L574 493C583 555 592 631 593 650Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,47.544,3.132)"><path d="M481 445L456 468C426 437 403 427 388 427C372 427 356 428 302 438C256 447 221 451 187 451C159 451 130 428 105 384C93 363 80 340 65 305L96 290C122 342 149 381 193 381C216 381 267 377 294 374S346 372 365 376L75 105C37 70 24 35 24 16C24 2 30 -5 35 -8C42 -8 46 -6 48 -2C58 14 75 35 90 41C102 46 116 46 147 32C200 8 267 -21 298 -21C347 -21 390 12 448 126L420 151C369 77 338 56 311 56C287 56 249 68 212 81C180 92 149 100 127 98C212 172 353 308 413 372L481 445Z"></path></g><g transform="matrix(.0065,0,0,-0.0065,51.912,5.233)"><path d="M394 0V37C301 42 295 50 295 122V635C236 613 178 596 109 583V553L165 551C205 549 209 544 209 495V122C209 50 203 42 111 37V0H394Z"></path></g><g transform="matrix(.013,0,0,-0.013,56.147,0)"><path d="M307 267V273L115 703H53L246 270L53 -163H115L307 267Z"></path></g></svg>.</span></div>

Mathematical Problems in Engineering

fig5

Figure 5

Figure 5: Calculating Crossing Numbers of Graphs Using Combinatorial Principles 