Click here to flash read.
arXiv:2403.19312v1 Announce Type: new
Abstract: 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.
Click here to read this post out
ID: 809047; Unique Viewers: 0
Unique Voters: 0
Total Votes: 0
Votes:
Latest Change: March 29, 2024, 7:32 a.m.
Changes:
Dictionaries:
Words:
Spaces:
Views: 14
CC:
No creative common's license
No creative common's license
Comments: