Robertson’s Conjecture in Algebraic Topology
Robertson’s Conjecture in Algebraic Topology
复制标题
代数拓扑中的罗伯逊猜想
DOI:
--
复制
发表时间:
2023
期刊:
影响因子:
--
通讯作者:
Eric Ramos
中科院分区:
文献类型:
--
作者:
Ben Knudsen;Eric Ramos
. One of the most famous results in graph theory is that of Kuratowski’s theorem, which states that a graph G is non-planar if and only if it contains one of K 3,3 or K 5 as a topological minor. That is, if some subdivision of either K 3,3 or K 5 appears as a subgraph of G . In this case we say that the question of planarity is determined by a finite set of forbidden (topological) minors. A conjecture of Robertson, whose proof was recently announced by Liu and Thomas, characterizes the kinds of graph theoretic properties that can be determined by finitely many forbidden minors. In this extended abstract we will present a categorical version of Robertson’s conjecture, which we have proven in certain cases. We will then illustrate how this categorification, if proven in all cases, would imply many non-trivial statements in the topology of graph configuration spaces.
登录
查看更多内容
影响因子:
0.7
作者:
Chettih;Safia;Luetgehetmann;Daniel
通讯作者:
Daniel
影响因子:
1.1
作者:
An, Byung Hee;Knudsen, Ben
通讯作者:
Knudsen, Ben
DOI:
10.1090/ert/616
发表时间:
2022
期刊:
Representation Theory of the American Mathematical Society
影响因子:
--
作者:
Proudfoot, Nicholas;Ramos, Eric
通讯作者:
Ramos, Eric
DOI:
10.1007/s00029-019-0509-4
发表时间:
2019
期刊:
Selecta Mathematica
影响因子:
--
作者:
Proudfoot, Nicholas;Ramos, Eric
通讯作者:
Ramos, Eric