Dips at small sizes for topological graph obstruction sets
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909186085879808 |
|---|---|
| author | Kim, Hyoungjun Mattman, Thomas W. |
| author_facet | Kim, Hyoungjun Mattman, Thomas W. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2205_14255 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Dips at small sizes for topological graph obstruction sets Kim, Hyoungjun Mattman, Thomas W. Geometric Topology Combinatorics 05C10 (Primary)57M15, 57K10 (Secondary) 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. |
| title | Dips at small sizes for topological graph obstruction sets |
| topic | Geometric Topology Combinatorics 05C10 (Primary)57M15, 57K10 (Secondary) |
| url | https://arxiv.org/abs/2205.14255 |