Dips at small sizes for topological graph obstruction sets

IF 1 3区 数学 Q3 MATHEMATICS, APPLIED
Hyoungjun Kim , Thomas W. Mattman
{"title":"Dips at small sizes for topological graph obstruction sets","authors":"Hyoungjun Kim ,&nbsp;Thomas W. Mattman","doi":"10.1016/j.dam.2024.08.022","DOIUrl":null,"url":null,"abstract":"<div><p>The Graph Minor Theorem of Robertson and Seymour implies a finite set of obstructions for any minor closed graph property. We show that there are only three obstructions to knotless embedding of size 23, which is far fewer than the 92 of size 22 and the hundreds known to exist at larger sizes. We describe several other topological properties whose obstruction set demonstrates a similar dip at small size. For order ten graphs, we classify the 35 obstructions to knotless embedding and the 49 maximal knotless graphs.</p></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"360 ","pages":"Pages 139-166"},"PeriodicalIF":1.0000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0166218X24003809/pdfft?md5=c1926af4981910e538f2e1efec68476e&pid=1-s2.0-S0166218X24003809-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X24003809","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

The Graph Minor Theorem of Robertson and Seymour implies a finite set of obstructions for any minor closed graph property. We show that there are only three obstructions to knotless embedding of size 23, which is far fewer than the 92 of size 22 and the hundreds known to exist at larger sizes. We describe several other topological properties whose obstruction set demonstrates a similar dip at small size. For order ten graphs, we classify the 35 obstructions to knotless embedding and the 49 maximal knotless graphs.

拓扑图阻碍集在小尺寸时的衰减
罗伯逊(Robertson)和西摩(Seymour)的 "图形次要定理"(Graph Minor Theorem of Robertson and Seymour)意味着任何次要封闭图形属性的障碍都是有限的。我们证明,大小为 23 的无结嵌入只有三个障碍,远远少于大小为 22 的 92 个障碍,也少于已知在更大大小时存在的数百个障碍。我们还描述了其他几种拓扑性质,它们的障碍集在小尺寸时也显示出类似的下降趋势。对于十阶图形,我们对 35 个无结嵌入障碍和 49 个最大无结图形进行了分类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Discrete Applied Mathematics
Discrete Applied Mathematics 数学-应用数学
CiteScore
2.30
自引率
9.10%
发文量
422
审稿时长
4.5 months
期刊介绍: The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal. Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信