Universal Planar Graphs for the Topological Minor Relation

IF 1 2区 数学 Q1 MATHEMATICS
Florian Lehner
{"title":"Universal Planar Graphs for the Topological Minor Relation","authors":"Florian Lehner","doi":"10.1007/s00493-023-00073-0","DOIUrl":null,"url":null,"abstract":"<p>Huynh et al. recently showed that a countable graph <i>G</i> which contains every countable planar graph as a subgraph must contain arbitrarily large finite complete graphs as topological minors, and an infinite complete graph as a minor. We strengthen this result by showing that the same conclusion holds if <i>G</i> contains every countable planar graph as a topological minor. In particular, there is no countable planar graph containing every countable planar graph as a topological minor, answering a question by Diestel and Kühn. Moreover, we construct a locally finite planar graph which contains every locally finite planar graph as a topological minor. This shows that in the above result it is not enough to require that <i>G</i> contains every locally finite planar graph as a topological minor.</p>","PeriodicalId":50666,"journal":{"name":"Combinatorica","volume":"27 19","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2023-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Combinatorica","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00493-023-00073-0","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 3

Abstract

Huynh et al. recently showed that a countable graph G which contains every countable planar graph as a subgraph must contain arbitrarily large finite complete graphs as topological minors, and an infinite complete graph as a minor. We strengthen this result by showing that the same conclusion holds if G contains every countable planar graph as a topological minor. In particular, there is no countable planar graph containing every countable planar graph as a topological minor, answering a question by Diestel and Kühn. Moreover, we construct a locally finite planar graph which contains every locally finite planar graph as a topological minor. This shows that in the above result it is not enough to require that G contains every locally finite planar graph as a topological minor.

Abstract Image

拓扑小关系的通用平面图
Huynh等人最近证明了一个包含所有可数平面图作为子图的可数图G必须包含任意大的有限完备图作为拓扑子图,以及一个无限完备图作为子图。我们通过证明当G包含所有可数平面图作为拓扑次元时,同样的结论成立来加强这一结果。特别地,不存在包含所有可数平面图作为拓扑次元的可数平面图,这回答了Diestel和k hn的问题。此外,我们构造了一个局部有限平面图,它包含了每一个局部有限平面图作为拓扑子图。这表明,在上述结果中,仅仅要求G包含每一个局部有限平面图作为拓扑次元是不够的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Combinatorica
Combinatorica 数学-数学
CiteScore
1.90
自引率
0.00%
发文量
45
审稿时长
>12 weeks
期刊介绍: COMBINATORICA publishes research papers in English in a variety of areas of combinatorics and the theory of computing, with particular emphasis on general techniques and unifying principles. Typical but not exclusive topics covered by COMBINATORICA are - Combinatorial structures (graphs, hypergraphs, matroids, designs, permutation groups). - Combinatorial optimization. - Combinatorial aspects of geometry and number theory. - Algorithms in combinatorics and related fields. - Computational complexity theory. - Randomization and explicit construction in combinatorics and algorithms.
×
引用
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学术官方微信