Knowledge (XXG)

Tutte–Coxeter graph

Source 📝

606: 590: 44: 367:
of the group of permutations swap one side of the bipartition for the other. As Coxeter showed, any path of up to five edges in the Tutte–Coxeter graph is equivalent to any other such path by one such automorphism.
363:
graph; these permutations act on the Tutte–Coxeter graph by permuting the vertices on each side of its bipartition while keeping each of the two sides fixed as a set. In addition, the
426: 281:; it was discovered by Tutte (1947) but its connection to geometric configurations was investigated by both authors in a pair of jointly published papers (Tutte 1958; Coxeter 1958a). 333:
to its 15 edges, as described by Coxeter (1958b), based on work by Sylvester (1844). Each vertex corresponds to an edge or a perfect matching, and connected vertices represent the
512: 549: 575: 453: 605: 483: 589: 203: 270: 943: 741: 295: 933: 938: 352:, which may be identified with the automorphisms of the group of permutations on six elements (Coxeter 1958b). The 192: 383: 948: 463: 95: 85: 456: 377: 288: 260: 188: 633:
Brouwer, A. E.; Cohen, A. M.; and Neumaier, A. Distance-Regular Graphs. New York: Springer-Verlag, 1989.
65: 488: 854: 826: 814: 750: 274: 240: 105: 345: 334: 244: 176: 75: 842: 774: 766: 364: 353: 349: 115: 528: 901: 892: 870: 834: 802: 758: 736: 722: 706: 659: 596: 554: 322: 278: 129: 58: 431: 786: 612: 341: 315: 252: 196: 184: 149: 139: 830: 754: 468: 326: 299: 927: 846: 778: 232: 28: 643: 303: 216: 159: 919: 680: 428:(there is an exceptional isomorphism between this group and the symmetric group 285: 248: 236: 212: 180: 172: 54: 17: 904: 43: 838: 806: 318: 256: 340:
Based on this construction, Coxeter showed that the Tutte–Coxeter graph is a
909: 875: 858: 762: 727: 710: 518:
vertices are either nonzero vectors, or isotropic 2-dimensional subspaces,
462:
Concretely, the Tutte-Coxeter graph can be defined from a 4-dimensional
664: 647: 770: 739:(1958b). "Twelve points in PG(5,3) with 95040 self-transformations". 791:"Elementary researches in the analysis of combinatorial aggregation" 790: 356:
of this group correspond to permuting the six vertices of the
291:
are known. The Tutte–Coxeter is one of the 13 such graphs.
455:). More specifically, it is the incidence graph of a 235:
with 30 vertices and 45 edges. As the unique smallest
557: 531: 491: 471: 434: 386: 168: 158: 148: 138: 128: 114: 104: 94: 84: 74: 64: 50: 36: 918:Exoo, G. "Rectilinear Drawings of Famous Graphs." 569: 543: 506: 477: 447: 420: 859:"The chords of the non-ruled quadric in PG(3,3)" 711:"The chords of the non-ruled quadric in PG(3,3)" 8: 697:Master Thesis, University of Tübingen, 2018 521:there is an edge between a nonzero vector 874: 726: 663: 556: 530: 498: 494: 493: 490: 470: 439: 433: 409: 405: 404: 394: 385: 525:and an isotropic 2-dimensional subspace 421:{\displaystyle Sp_{4}(\mathbb {F} _{2})} 681:"Rectilinear Drawings of Famous Graphs" 626: 585: 817:(1947). "A family of cubical graphs". 33: 372:The Tutte–Coxeter graph as a building 7: 695:Engineering Linear Layouts with SAT. 380:associated to the symplectic group 742:Proceedings of the Royal Society A 25: 615:of the Tutte–Coxeter graph is 3. 604: 599:of the Tutte–Coxeter graph is 2. 588: 507:{\displaystyle \mathbb {F} _{2}} 255:, and can be constructed as the 42: 314:The Tutte–Coxeter graph is the 310:Constructions and automorphisms 415: 400: 271:Cremona–Richmond configuration 204:Table of graphs and parameters 1: 337:between edges and matchings. 893:"3D Model of Tutte's 8-cage" 273:). The graph is named after 819:Proc. Cambridge Philos. Soc 965: 544:{\displaystyle W\subset V} 26: 944:Configurations (geometry) 839:10.1017/S0305004100023720 807:10.1080/14786444408644856 202: 41: 648:"Crossing Number Graphs" 27:Not to be confused with 464:symplectic vector space 289:distance-regular graphs 876:10.4153/CJM-1958-046-3 763:10.1098/rspa.1958.0184 728:10.4153/CJM-1958-047-0 571: 570:{\displaystyle v\in W} 545: 508: 479: 457:generalized quadrangle 449: 422: 261:generalized quadrangle 229:Cremona–Richmond graph 572: 546: 509: 480: 450: 448:{\displaystyle S_{6}} 423: 555: 529: 489: 469: 432: 384: 275:William Thomas Tutte 831:1947PCPS...43..459T 755:1958RSPSA.247..279C 652:Mathematica Journal 646:; Exoo, G. (2009). 365:outer automorphisms 354:inner automorphisms 335:incidence structure 221:Tutte–Coxeter graph 193:Distance-transitive 37:Tutte–Coxeter graph 934:1958 introductions 902:Weisstein, Eric W. 891:François Labelle. 665:10.3888/tmj.11.2-2 567: 541: 504: 475: 445: 418: 378:spherical building 376:This graph is the 321:connecting the 15 939:Individual graphs 749:(1250): 279–293. 737:Coxeter, H. S. M. 707:Coxeter, H. S. M. 478:{\displaystyle V} 323:perfect matchings 209: 208: 16:(Redirected from 956: 915: 914: 896: 880: 878: 850: 810: 787:Sylvester, J. J. 782: 732: 730: 698: 691: 685: 684: 676: 670: 669: 667: 640: 634: 631: 608: 597:chromatic number 592: 576: 574: 573: 568: 550: 548: 547: 542: 513: 511: 510: 505: 503: 502: 497: 484: 482: 481: 476: 454: 452: 451: 446: 444: 443: 427: 425: 424: 419: 414: 413: 408: 399: 398: 279:H. S. M. Coxeter 225:Tutte eight-cage 189:Distance-regular 130:Chromatic number 59:H. S. M. Coxeter 46: 34: 21: 18:Tutte eight cage 964: 963: 959: 958: 957: 955: 954: 953: 924: 923: 900: 899: 890: 887: 853: 813: 785: 735: 705: 702: 701: 693:Wolz, Jessica; 692: 688: 678: 677: 673: 642: 641: 637: 632: 628: 623: 616: 613:chromatic index 609: 600: 593: 584: 553: 552: 551:if and only if 527: 526: 492: 487: 486: 467: 466: 435: 430: 429: 403: 390: 382: 381: 374: 362: 342:symmetric graph 332: 312: 296:crossing number 268: 195: 191: 187: 183: 179: 175: 140:Chromatic index 123: 57: 32: 23: 22: 15: 12: 11: 5: 962: 960: 952: 951: 949:Regular graphs 946: 941: 936: 926: 925: 922: 921: 916: 897: 886: 885:External links 883: 882: 881: 851: 825:(4): 459–474. 811: 783: 733: 700: 699: 686: 671: 635: 625: 624: 622: 619: 618: 617: 610: 603: 601: 594: 587: 583: 580: 579: 578: 566: 563: 560: 540: 537: 534: 519: 501: 496: 474: 442: 438: 417: 412: 407: 402: 397: 393: 389: 373: 370: 360: 330: 327:complete graph 325:of a 6-vertex 311: 308: 300:book thickness 269:(known as the 266: 207: 206: 200: 199: 170: 166: 165: 162: 156: 155: 152: 150:Book thickness 146: 145: 142: 136: 135: 132: 126: 125: 121: 118: 112: 111: 108: 102: 101: 98: 92: 91: 88: 82: 81: 78: 72: 71: 68: 62: 61: 52: 48: 47: 39: 38: 24: 14: 13: 10: 9: 6: 4: 3: 2: 961: 950: 947: 945: 942: 940: 937: 935: 932: 931: 929: 920: 917: 912: 911: 906: 903: 898: 894: 889: 888: 884: 877: 872: 868: 864: 860: 856: 852: 848: 844: 840: 836: 832: 828: 824: 820: 816: 812: 808: 804: 800: 796: 792: 788: 784: 780: 776: 772: 768: 764: 760: 756: 752: 748: 744: 743: 738: 734: 729: 724: 720: 716: 712: 708: 704: 703: 696: 690: 687: 682: 675: 672: 666: 661: 657: 653: 649: 645: 639: 636: 630: 627: 620: 614: 607: 602: 598: 591: 586: 581: 564: 561: 558: 538: 535: 532: 524: 520: 517: 516: 515: 499: 472: 465: 460: 458: 440: 436: 410: 395: 391: 387: 379: 371: 369: 366: 359: 355: 351: 350:automorphisms 347: 343: 338: 336: 328: 324: 320: 317: 309: 307: 305: 301: 297: 292: 290: 287: 282: 280: 276: 272: 265: 262: 258: 254: 250: 246: 242: 238: 234: 233:regular graph 230: 226: 222: 218: 214: 205: 201: 198: 194: 190: 186: 182: 178: 174: 171: 167: 163: 161: 157: 153: 151: 147: 143: 141: 137: 133: 131: 127: 119: 117: 116:Automorphisms 113: 109: 107: 103: 99: 97: 93: 89: 87: 83: 79: 77: 73: 69: 67: 63: 60: 56: 53: 49: 45: 40: 35: 30: 29:Coxeter graph 19: 908: 905:"Levi Graph" 866: 863:Can. J. Math 862: 855:Tutte, W. T. 822: 818: 815:Tutte, W. T. 798: 797:. Series 3. 794: 746: 740: 718: 715:Can. J. Math 714: 694: 689: 674: 655: 651: 638: 629: 522: 514:as follows: 461: 375: 357: 339: 313: 304:queue number 293: 283: 263: 228: 224: 220: 217:graph theory 213:mathematical 210: 160:Queue number 869:: 481–483. 801:: 285–295. 721:: 484–488. 644:Pegg, E. T. 344:; it has a 249:Moore graph 243:8, it is a 237:cubic graph 181:Moore graph 120:1440 (Aut(S 55:W. T. Tutte 51:Named after 928:Categories 621:References 319:Levi graph 257:Levi graph 169:Properties 910:MathWorld 847:123505185 795:Phil. Mag 779:121676627 709:(1958a). 679:Exoo, G. 562:∈ 536:⊂ 316:bipartite 253:bipartite 215:field of 197:Bipartite 185:Symmetric 857:(1958). 789:(1844). 348:of 1440 284:All the 251:. It is 96:Diameter 66:Vertices 827:Bibcode 751:Bibcode 582:Gallery 294:It has 259:of the 231:is a 3- 211:In the 845:  777:  771:100667 769:  302:3 and 247:and a 219:, the 86:Radius 843:S2CID 775:S2CID 767:JSTOR 658:(2). 485:over 346:group 286:cubic 241:girth 173:Cubic 106:Girth 76:Edges 611:The 595:The 298:13, 277:and 245:cage 177:Cage 871:doi 835:doi 803:doi 759:doi 747:247 723:doi 660:doi 306:2. 239:of 227:or 223:or 930:: 907:. 867:10 865:. 861:. 841:. 833:. 823:43 821:. 799:24 793:. 773:. 765:. 757:. 745:. 719:10 717:. 713:. 656:11 654:. 650:. 459:. 124:)) 80:45 70:30 913:. 895:. 879:. 873:: 849:. 837:: 829:: 809:. 805:: 781:. 761:: 753:: 731:. 725:: 683:. 668:. 662:: 577:. 565:W 559:v 539:V 533:W 523:v 500:2 495:F 473:V 441:6 437:S 416:) 411:2 406:F 401:( 396:4 392:p 388:S 361:6 358:K 331:6 329:K 267:2 264:W 164:2 154:3 144:3 134:2 122:6 110:8 100:4 90:4 31:. 20:)

Index

Tutte eight cage
Coxeter graph

W. T. Tutte
H. S. M. Coxeter
Vertices
Edges
Radius
Diameter
Girth
Automorphisms
Chromatic number
Chromatic index
Book thickness
Queue number
Cubic
Cage
Moore graph
Symmetric
Distance-regular
Distance-transitive
Bipartite
Table of graphs and parameters
mathematical
graph theory
regular graph
cubic graph
girth
cage
Moore graph

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.