Knowledge (XXG)

Heawood family

Source 📝

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

Index

Heawood graphs
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

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