Calculating Crossing Numbers of Graphs Using Combinatorial Principles

<div>A good drawing of <span class="nowrap"><svg height="13.639pt" id="M111" style="vertical-align:-4.35067pt" version="1.1" viewbox="-0.0498162 -9.28833 48.7864 13.639" width="48.7864pt" 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="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,9.23,3.132)"><path d="M389 0V32C297 38 291 46 291 118V635C234 613 175 595 109 583V556L161 554C203 552 207 547 207 497V118C207 46 201 38 110 32V0H389Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,13.662,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,15.818,3.132)"><path d="M462 177V227H365V632H320C217 496 116 350 21 208V177H284V109C284 43 280 38 190 31V0H451V31C369 38 365 43 365 108V177H462ZM284 227H88C155 336 218 430 282 519H284V227Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,20.25,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,22.407,3.132)"><path d="M504 89L488 119C453 85 428 69 416 69C408 69 405 75 412 102L462 304C492 438 460 451 436 451S388 441 356 423C311 397 229 336 170 256H168L189 340C208 418 200 451 177 451C144 451 82 413 24 352L40 322C65 345 98 369 108 369C114 369 119 363 112 335L28 -3L36 -12C54 -3 83 4 112 10C125 73 138 122 153 174C205 258 328 382 376 382C395 382 399 369 384 305L330 93C312 25 323 -12 351 -12C378 -12 439 21 504 89Z"></path></g><g transform="matrix(.013,0,0,-0.013,27.631,0)"><path d="M368 -163L103 703H44L308 -163H368Z"></path></g><g transform="matrix(.013,0,0,-0.013,32.982,0)"><path d="M391 364C391 409 353 448 295 448C249 448 198 426 152 393C65 331 23 225 23 139C23 14 96 -12 146 -12C198 -12 280 9 367 101L351 124C300 78 242 48 194 48C129 48 109 107 109 162V191C208 213 391 266 391 364ZM313 350C313 305 268 261 113 223C132 334 187 381 217 398C227 404 244 405 261 405C290 405 313 385 313 350Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,38.299,3.132)"><path d="M545 403C545 425 527 451 498 451C448 451 400 404 312 286L290 341C262 412 246 451 219 451C182 451 138 404 92 345L112 323C152 368 169 378 181 378C192 378 201 359 216 321L257 214C184 115 142 69 113 69C102 69 93 73 88 79S78 89 68 89C47 89 24 61 24 40C24 8 49 -12 75 -12C125 -12 175 31 271 175L312 64C330 15 357 -12 382 -12C421 -12 475 35 515 98L496 121C466 88 439 62 420 62C402 62 384 92 363 147L325 247C349 280 374 309 397 333C422 361 446 381 462 381C471 381 481 374 488 366C493 360 499 357 505 357C521 357 545 380 545 403Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,43.477,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></svg>.</span></div>

Mathematical Problems in Engineering

fig1

Figure 1

Figure 1: Calculating Crossing Numbers of Graphs Using Combinatorial Principles 