The Extremal Function for Bipartite Linklessly Embeddable Graphs
The Extremal Function for Bipartite Linklessly Embeddable Graphs
复制标题
二部无链接嵌入图的极值函数
DOI:
10.1007/s00493-019-3856-z
复制
发表时间:
2019
期刊:
影响因子:
1.1
通讯作者:
Thomas, Robin
中科院分区:
文献类型:
--
作者:
McCarty, Rose;Thomas, Robin
An embedding of a graph in 3-space islinklessif for every two disjoint cycles there exists an embedded ball that contains one of the cycles and is disjoint from the other. We prove that every bipartite linklessly embeddable (simple) graph onn≥ 5 vertices has at most 3n- 10 edges, unless it is isomorphic to the complete bipartite graphK3,n-3.
登录
查看更多内容
DOI:
--
发表时间:
2004
期刊:
Comb.
影响因子:
--
作者:
Eran Nevo
通讯作者:
Eran Nevo
影响因子:
0.9
作者:
L. Lovász;A. Schrijver
通讯作者:
A. Schrijver
影响因子:
1
作者:
Thomas, Robin;Yoo, Youngho
通讯作者:
Yoo, Youngho
DOI:
--
发表时间:
1989
期刊:
影响因子:
--
作者:
A. Kostochka
通讯作者:
A. Kostochka
影响因子:
0.7
作者:
Rose McCarty
通讯作者:
Rose McCarty