Explicit bounds for graph minors

Geelen Jim; Huynh Tony; Richter R. Bruce

首页> 外文期刊>Journal of Combinatorial Theory, Series B >Explicit bounds for graph minors

【24h】

Explicit bounds for graph minors

机译：图形未成年人的显式范围

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

Let Sigma be a surface with boundary bd(Sigma), L be a collection of k disjoint bd(Sigma)-paths in Sigma, and P be a non-separating bd(Sigma)-path in Sigma. We prove that there is a homeomorphism Phi : Sigma - Sigma that fixes each point of bd(Sigma) and such that Phi(L) meets P at most 2k times.

机译：让Sigma是具有边界BD（Sigma）的表面，L是ΣBd（Sigma）-Paths中的X次的集合，P是Sigma中的非分离BD（Sigma）-Path。我们证明有一个同源形态的phi：sigma - ＆修复BD（Sigma）的每个点的Sigma，使PHI（L）满足P最多2K次。

著录项

来源
《Journal of Combinatorial Theory, Series B》 |2018年第2018期|共27页
作者
Geelen Jim; Huynh Tony; Richter R. Bruce;
展开▼
作者单位

Univ Waterloo Dept Combinator &

Optimizat 200 Univ Ave West Waterloo ON N2L 3G1 Canada;

Univ Libre Bruxelles Dept Math Ave Franklin Roosevelt 50 B-1050 Brussels Belgium;

Univ Waterloo Dept Combinator &

Optimizat 200 Univ Ave West Waterloo ON N2L 3G1 Canada;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类代数、数论、组合理论;
关键词
Graphs; Surfaces; Linkages; Minors;

机译：图形;表面;联系;未成年人;

相似文献

外文文献
中文文献
专利

1. Explicit bounds for graph minors [J] . Geelen Jim, Huynh Tony, Richter R. Bruce Journal of Combinatorial Theory, Series B . 2018,第期

机译：图形未成年人的显式范围
2. andom walks and forbidden minors II: A poly ( d eps ? 1 ) -query tester for minor-closed properties of bounded degree graphs [J] . Akash Kumar, C. Seshadhri, Andrew Stolman Electronic Colloquium on Computational Complexity . 2019,第136期

机译：随机游走和禁止的未成年人II：A poly（d eps？1）-查询测试器，用于有限度图的次闭合特性
3. Finding forbidden minors in sublinear time: a O ( n 1 2+ o (1) ) -query one-sided tester for minor closed properties on bounded degree graphs [J] . Akash Kumar, C. Seshadhri, Andrew Stolman Electronic Colloquium on Computational Complexity . 2018,第9期

机译：在亚线性时间中查找禁止的未成年人：O（n 1 2+ o（1））-查询单边测试器以寻找有界度图上的次要闭合性质
4. Finding Forbidden Minors in Sublinear Time: A n^1/2+o(1)-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs [C] . Akash Kumar, C. Seshadhri, Andrew Stolman IEEE Annual Symposium on Foundations of Computer Science . 2018

机译：在亚线性时间中查找禁止的未成年人：有界度图上的次闭合特性的n ^ 1/2 + o（1）-查询单面测试器
5. On the attainability of upper bounds for the circular chromatic number of K4-minor-free graphs. [D] . Holt, Tracy. 2008

机译：关于K4次无图的圆色数的上限的可实现性。
6. Correction to: Explicit upper bound for the average number of divisors of irreducible quadratic polynomials [O] . Kostadinka Lapkova -1

机译：更正为：不可约二次多项式的平均除数的明确上限
7. Explicit bounds for graph minors [O] . Jim Geelen, Tony Huynh, R. Bruce Richter 2018

机译：图未成年人的明确界限
8. Three-Level Energy Balance Climate Model with Topography, Explicit Radiative Transfer, and Explicit Sea Ice and Snow Mass Budgets [R] . Harvey, L. D. D. 1986

机译：具有地形，显式辐射传输和明确海冰和雪质量预算的三能级平衡气候模型

Explicit bounds for graph minors

摘要

著录项

相似文献

相关主题

期刊订阅