{"title":"最大无结图","authors":"L. Eakins, Thomas Fleming, T. Mattman","doi":"10.2140/agt.2023.23.1831","DOIUrl":null,"url":null,"abstract":"A graph is maximal knotless if it is edge maximal for the property of knotless embedding in $R^3$. We show that such a graph has at least $\\frac74 |V|$ edges, and construct an infinite family of maximal knotless graphs with $|E|<\\frac52|V|$. With the exception of $|E| = 22$, we show that for any $|E| \\geq 20$ there exists a maximal knotless graph of size $|E|$. We classify the maximal knotless graphs through nine vertices and 20 edges. We determine which of these maxnik graphs are the clique sum of smaller graphs and construct an infinite family of maxnik graphs that are not clique sums.","PeriodicalId":50826,"journal":{"name":"Algebraic and Geometric Topology","volume":"3 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Maximal knotless graphs\",\"authors\":\"L. Eakins, Thomas Fleming, T. Mattman\",\"doi\":\"10.2140/agt.2023.23.1831\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A graph is maximal knotless if it is edge maximal for the property of knotless embedding in $R^3$. We show that such a graph has at least $\\\\frac74 |V|$ edges, and construct an infinite family of maximal knotless graphs with $|E|<\\\\frac52|V|$. With the exception of $|E| = 22$, we show that for any $|E| \\\\geq 20$ there exists a maximal knotless graph of size $|E|$. We classify the maximal knotless graphs through nine vertices and 20 edges. We determine which of these maxnik graphs are the clique sum of smaller graphs and construct an infinite family of maxnik graphs that are not clique sums.\",\"PeriodicalId\":50826,\"journal\":{\"name\":\"Algebraic and Geometric Topology\",\"volume\":\"3 1\",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2021-01-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Algebraic and Geometric Topology\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.2140/agt.2023.23.1831\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Algebraic and Geometric Topology","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.2140/agt.2023.23.1831","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
A graph is maximal knotless if it is edge maximal for the property of knotless embedding in $R^3$. We show that such a graph has at least $\frac74 |V|$ edges, and construct an infinite family of maximal knotless graphs with $|E|<\frac52|V|$. With the exception of $|E| = 22$, we show that for any $|E| \geq 20$ there exists a maximal knotless graph of size $|E|$. We classify the maximal knotless graphs through nine vertices and 20 edges. We determine which of these maxnik graphs are the clique sum of smaller graphs and construct an infinite family of maxnik graphs that are not clique sums.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
