Knowledge (XXG)

Heawood family

Source 📝

644: 1188: 838: 762: 569: 520: 472: 423: 142: 1218: 1110: 1012: 912: 681: 1080: 978: 878: 206: 1143: 1041: 945: 793: 717: 374: 329: 298: 268: 237: 97: 67: 1249:
Goldberg, N., Mattman, T. W., & Naimi, R. (2014). Many, many more intrinsically knotted graphs. Algebraic & Geometric Topology, 14(3), 1801-1823.
342:, all of which are minor minimal with this property. The other six graphs have knotless embeddings. This shows that knotless graphs are not closed under 686: 851:
built on them can be embedded into 4-space. Hein van der Holst (2006) showed that the graphs in the Heawood family are not 4-flat and have
852: 180: 888:. Van der Holst suggested that they might form the complete list of excluded minors for both the 4-flat graphs and the graphs with 765: 523: 343: 301: 32: 575: 475: 339: 172: 917:
This conjecture can be further motivated from structural similarities to other topologically defined graphs classes:
168: 1293: 585: 1262: 1191: 844: 176: 1148: 798: 722: 529: 480: 432: 383: 102: 1197: 1089: 991: 891: 660: 1046: 950: 981: 857: 526:. The family consists of 58 graphs, all of which have 22 edges. The unique smallest member, 304:. The family consists of 20 graphs, all of which have 21 edges. The unique smallest member, 185: 1121: 1019: 923: 771: 695: 352: 307: 276: 246: 215: 75: 45: 1113: 157: 657:
Is the Heawood family the complete list of excluded minors of the 4-flat graphs and for
1083: 885: 271: 161: 40: 1287: 332: 153: 17: 985: 881: 24: 31:
refers to either one of the following two related graph families generated via
848: 148:
In either setting the members of the graph family are collectively known as
649: 1275: 581: 571:, has eight vertices. The unique largest member has 14 vertices. 379: 211: 171:. They contain the smallest known examples for graphs that are 1265:. Journal of Combinatorial Theory, Series B, 96(3), 388-404. 847:, i.e., graphs with the property that every 2-dimensional 1200: 1151: 1124: 1092: 1049: 1022: 994: 953: 926: 894: 860: 801: 774: 725: 698: 663: 588: 532: 483: 435: 386: 355: 331:, has seven vertices. The unique largest member, the 310: 279: 249: 218: 188: 105: 78: 48: 1190:
are conjectured to generate all excluded minors for
843:This graph family has significance in the study of 1212: 1182: 1137: 1104: 1074: 1035: 1006: 972: 939: 906: 872: 832: 787: 756: 711: 675: 638: 563: 514: 466: 417: 368: 323: 292: 262: 231: 200: 136: 91: 61: 167:The Heawood families play a significant role in 20:, which is a member of the Heawood graph family. 8: 1276:Topological Symmetries of the Heawood family 1245: 1243: 1241: 1239: 1237: 633: 589: 39:the family of 20 graphs generated from the 1263:Graphs and obstructions in four dimensions 578:and are minor minimal with this property. 160:, which too is named after its member the 1199: 1156: 1150: 1129: 1123: 1091: 1054: 1048: 1027: 1021: 993: 958: 952: 931: 925: 893: 859: 806: 800: 779: 773: 730: 724: 703: 697: 662: 609: 596: 587: 537: 531: 488: 482: 440: 434: 391: 385: 360: 354: 315: 309: 284: 278: 254: 248: 223: 217: 187: 110: 104: 83: 77: 53: 47: 1257: 1255: 1233: 692:The Heawood family generated from both 687:(more unsolved problems in mathematics) 156:is a member. This is in analogy to the 72:the family of 78 graphs generated from 1274:Mellor, B., & Wilson, R. (2023). 639:{\displaystyle \{K_{7},K_{3,3,1,1}\}} 7: 840:-family. It consists of 78 graphs. 1278:. arXiv preprint arXiv:2311.08573. 880:. In particular, they are neither 376:-family are intrinsically chiral. 14: 1082:generate all excluded minors for 853:Colin de Verdière graph invariant 338:Only 14 out of the 20 graphs are 181:Colin de Verdière graph invariant 764:through repeated application of 522:through repeated application of 300:through repeated application of 652:Unsolved problem in mathematics 984:) are the excluded minors for 574:All graphs in this family are 474:-family is generated from the 270:-family is generated from the 1: 768:is the disjoint union of the 16:Not to be confused with the 1183:{\displaystyle K_{3,3,1,1}} 833:{\displaystyle K_{3,3,1,1}} 757:{\displaystyle K_{3,3,1,1}} 564:{\displaystyle K_{3,3,1,1}} 515:{\displaystyle K_{3,3,1,1}} 476:complete multipartite graph 467:{\displaystyle K_{3,3,1,1}} 418:{\displaystyle K_{3,3,1,1}} 137:{\displaystyle K_{3,3,1,1}} 1310: 1261:van der Holst, H. (2006). 1213:{\displaystyle \mu \leq 5} 1105:{\displaystyle \mu \leq 4} 1007:{\displaystyle \mu \leq 3} 907:{\displaystyle \mu \leq 5} 766:ΔY- and YΔ-transformations 676:{\displaystyle \mu \leq 5} 524:ΔY- and YΔ-transformations 344:ΔY- and YΔ-transformations 302:ΔY- and YΔ-transformations 33:ΔY- and YΔ-transformations 15: 1075:{\displaystyle K_{3,3,1}} 169:topological graph theory 973:{\displaystyle K_{3,3}} 1214: 1184: 1139: 1106: 1076: 1037: 1008: 974: 941: 908: 874: 873:{\displaystyle \mu =6} 834: 789: 758: 713: 677: 640: 565: 516: 468: 419: 370: 325: 294: 264: 233: 202: 201:{\displaystyle \mu =6} 138: 93: 63: 1215: 1185: 1140: 1138:{\displaystyle K_{7}} 1107: 1077: 1038: 1036:{\displaystyle K_{6}} 1009: 975: 942: 940:{\displaystyle K_{5}} 909: 875: 835: 790: 788:{\displaystyle K_{7}} 759: 714: 712:{\displaystyle K_{7}} 678: 641: 576:intrinsically knotted 566: 517: 469: 420: 371: 369:{\displaystyle K_{7}} 340:intrinsically knotted 326: 324:{\displaystyle K_{7}} 295: 293:{\displaystyle K_{7}} 265: 263:{\displaystyle K_{7}} 234: 232:{\displaystyle K_{7}} 203: 173:intrinsically knotted 139: 94: 92:{\displaystyle K_{7}} 64: 62:{\displaystyle K_{7}} 1198: 1149: 1122: 1090: 1047: 1020: 992: 951: 924: 892: 858: 799: 772: 723: 696: 661: 586: 530: 481: 433: 384: 353: 308: 277: 247: 216: 186: 103: 76: 46: 349:All members of the 335:, has 14 vertices. 1210: 1180: 1135: 1102: 1072: 1033: 1004: 970: 937: 904: 870: 830: 785: 754: 709: 673: 636: 561: 512: 464: 415: 366: 321: 290: 260: 229: 198: 134: 89: 59: 982:Kuratowski graphs 1301: 1279: 1272: 1266: 1259: 1250: 1247: 1219: 1217: 1216: 1211: 1189: 1187: 1186: 1181: 1179: 1178: 1144: 1142: 1141: 1136: 1134: 1133: 1111: 1109: 1108: 1103: 1081: 1079: 1078: 1073: 1071: 1070: 1042: 1040: 1039: 1034: 1032: 1031: 1013: 1011: 1010: 1005: 979: 977: 976: 971: 969: 968: 946: 944: 943: 938: 936: 935: 913: 911: 910: 905: 879: 877: 876: 871: 839: 837: 836: 831: 829: 828: 795:-family and the 794: 792: 791: 786: 784: 783: 763: 761: 760: 755: 753: 752: 718: 716: 715: 710: 708: 707: 682: 680: 679: 674: 653: 645: 643: 642: 637: 632: 631: 601: 600: 570: 568: 567: 562: 560: 559: 521: 519: 518: 513: 511: 510: 473: 471: 470: 465: 463: 462: 424: 422: 421: 416: 414: 413: 375: 373: 372: 367: 365: 364: 330: 328: 327: 322: 320: 319: 299: 297: 296: 291: 289: 288: 269: 267: 266: 261: 259: 258: 238: 236: 235: 230: 228: 227: 207: 205: 204: 199: 143: 141: 140: 135: 133: 132: 98: 96: 95: 90: 88: 87: 68: 66: 65: 60: 58: 57: 1309: 1308: 1304: 1303: 1302: 1300: 1299: 1298: 1284: 1283: 1282: 1273: 1269: 1260: 1253: 1248: 1235: 1231: 1196: 1195: 1152: 1147: 1146: 1125: 1120: 1119: 1114:Petersen family 1088: 1087: 1084:linkless graphs 1050: 1045: 1044: 1023: 1018: 1017: 990: 989: 954: 949: 948: 927: 922: 921: 890: 889: 856: 855: 802: 797: 796: 775: 770: 769: 726: 721: 720: 699: 694: 693: 690: 689: 684: 659: 658: 655: 651: 648: 605: 592: 584: 583: 533: 528: 527: 484: 479: 478: 436: 431: 430: 427: 387: 382: 381: 356: 351: 350: 311: 306: 305: 280: 275: 274: 250: 245: 244: 241: 219: 214: 213: 184: 183: 179:, or that have 175:, that are not 158:Petersen family 106: 101: 100: 79: 74: 73: 49: 44: 43: 21: 12: 11: 5: 1307: 1305: 1297: 1296: 1294:Graph families 1286: 1285: 1281: 1280: 1267: 1251: 1232: 1230: 1227: 1226: 1225: 1222:Heawood family 1209: 1206: 1203: 1177: 1174: 1171: 1168: 1165: 1162: 1159: 1155: 1132: 1128: 1117: 1101: 1098: 1095: 1069: 1066: 1063: 1060: 1057: 1053: 1030: 1026: 1015: 1003: 1000: 997: 967: 964: 961: 957: 934: 930: 903: 900: 897: 869: 866: 863: 827: 824: 821: 818: 815: 812: 809: 805: 782: 778: 751: 748: 745: 742: 739: 736: 733: 729: 706: 702: 685: 672: 669: 666: 656: 650: 647: 635: 630: 627: 624: 621: 618: 615: 612: 608: 604: 599: 595: 591: 580: 558: 555: 552: 549: 546: 543: 540: 536: 509: 506: 503: 500: 497: 494: 491: 487: 461: 458: 455: 452: 449: 446: 443: 439: 426: 412: 409: 406: 403: 400: 397: 394: 390: 378: 363: 359: 318: 314: 287: 283: 272:complete graph 257: 253: 240: 226: 222: 210: 197: 194: 191: 162:Petersen graph 150:Heawood graphs 146: 145: 131: 128: 125: 122: 119: 116: 113: 109: 86: 82: 70: 56: 52: 41:complete graph 29:Heawood family 13: 10: 9: 6: 4: 3: 2: 1306: 1295: 1292: 1291: 1289: 1277: 1271: 1268: 1264: 1258: 1256: 1252: 1246: 1244: 1242: 1240: 1238: 1234: 1228: 1223: 1207: 1204: 1201: 1193: 1192:4-flat graphs 1175: 1172: 1169: 1166: 1163: 1160: 1157: 1153: 1130: 1126: 1118: 1115: 1099: 1096: 1093: 1085: 1067: 1064: 1061: 1058: 1055: 1051: 1028: 1024: 1016: 1001: 998: 995: 987: 986:planar graphs 983: 965: 962: 959: 955: 932: 928: 920: 919: 918: 915: 901: 898: 895: 887: 883: 867: 864: 861: 854: 850: 846: 845:4-flat graphs 841: 825: 822: 819: 816: 813: 810: 807: 803: 780: 776: 767: 749: 746: 743: 740: 737: 734: 731: 727: 704: 700: 688: 670: 667: 664: 628: 625: 622: 619: 616: 613: 610: 606: 602: 597: 593: 579: 577: 572: 556: 553: 550: 547: 544: 541: 538: 534: 525: 507: 504: 501: 498: 495: 492: 489: 485: 477: 459: 456: 453: 450: 447: 444: 441: 437: 410: 407: 404: 401: 398: 395: 392: 388: 377: 361: 357: 347: 345: 341: 336: 334: 333:Heawood graph 316: 312: 303: 285: 281: 273: 255: 251: 224: 220: 209: 195: 192: 189: 182: 178: 174: 170: 165: 163: 159: 155: 154:Heawood graph 151: 129: 126: 123: 120: 117: 114: 111: 107: 84: 80: 71: 54: 50: 42: 38: 37: 36: 34: 30: 26: 19: 18:Heawood graph 1270: 1221: 916: 842: 691: 573: 428: 348: 337: 242: 166: 149: 147: 28: 25:graph theory 22: 1229:References 849:CW complex 1205:≤ 1202:μ 1097:≤ 1094:μ 999:≤ 996:μ 899:≤ 896:μ 862:μ 668:≤ 665:μ 190:μ 152:, as the 27:the term 1288:Category 886:linkless 646:-family 425:-family 239:-family 882:planar 177:4-flat 1220:(the 1112:(the 980:(the 1194:and 1145:and 1086:and 1043:and 988:and 947:and 884:nor 719:and 582:The 429:The 380:The 243:The 212:The 99:and 23:In 1290:: 1254:^ 1236:^ 1224:). 1116:). 914:. 346:. 208:. 164:. 35:: 1208:5 1176:1 1173:, 1170:1 1167:, 1164:3 1161:, 1158:3 1154:K 1131:7 1127:K 1100:4 1068:1 1065:, 1062:3 1059:, 1056:3 1052:K 1029:6 1025:K 1014:. 1002:3 966:3 963:, 960:3 956:K 933:5 929:K 902:5 868:6 865:= 826:1 823:, 820:1 817:, 814:3 811:, 808:3 804:K 781:7 777:K 750:1 747:, 744:1 741:, 738:3 735:, 732:3 728:K 705:7 701:K 683:? 671:5 654:: 634:} 629:1 626:, 623:1 620:, 617:3 614:, 611:3 607:K 603:, 598:7 594:K 590:{ 557:1 554:, 551:1 548:, 545:3 542:, 539:3 535:K 508:1 505:, 502:1 499:, 496:3 493:, 490:3 486:K 460:1 457:, 454:1 451:, 448:3 445:, 442:3 438:K 411:1 408:, 405:1 402:, 399:3 396:, 393:3 389:K 362:7 358:K 317:7 313:K 286:7 282:K 256:7 252:K 225:7 221:K 196:6 193:= 144:. 130:1 127:, 124:1 121:, 118:3 115:, 112:3 108:K 85:7 81:K 69:. 55:7 51:K

Index

Heawood graph
graph theory
ΔY- and YΔ-transformations
complete graph
Heawood graph
Petersen family
Petersen graph
topological graph theory
intrinsically knotted
4-flat
Colin de Verdière graph invariant
complete graph
ΔY- and YΔ-transformations
Heawood graph
intrinsically knotted
ΔY- and YΔ-transformations
complete multipartite graph
ΔY- and YΔ-transformations
intrinsically knotted
(more unsolved problems in mathematics)
ΔY- and YΔ-transformations
4-flat graphs
CW complex
Colin de Verdière graph invariant
planar
linkless
Kuratowski graphs
planar graphs
linkless graphs
Petersen family

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