On the $k$-anti-traceability Conjecture
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917624782258176 |
|---|---|
| author | Chen, Bin Gerke, Stefanie Gutin, Gregory Lei, Hui Parker-Cox, Heis Zhou, Yacong |
| author_facet | Chen, Bin Gerke, Stefanie Gutin, Gregory Lei, Hui Parker-Cox, Heis Zhou, Yacong |
| contents | An oriented graph is called $k$-anti-traceable if the subdigraph induced by every subset with $k$ vertices has a hamiltonian anti-directed path. In this paper, we consider an anti-traceability conjecture. In particular, we confirm this conjecture holds when $k\leq 4$. We also show that every sufficiently large $k$-anti-traceable oriented graph admits an anti-path that contains $n-o(n)$ vertices. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_19312 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the $k$-anti-traceability Conjecture Chen, Bin Gerke, Stefanie Gutin, Gregory Lei, Hui Parker-Cox, Heis Zhou, Yacong Combinatorics An oriented graph is called $k$-anti-traceable if the subdigraph induced by every subset with $k$ vertices has a hamiltonian anti-directed path. In this paper, we consider an anti-traceability conjecture. In particular, we confirm this conjecture holds when $k\leq 4$. We also show that every sufficiently large $k$-anti-traceable oriented graph admits an anti-path that contains $n-o(n)$ vertices. |
| title | On the $k$-anti-traceability Conjecture |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2403.19312 |