Metraipolis › archive › dc_a2cbaccb4653

Separating Path Systems of Size at most $7.75n$ — arXiv:2610.07488

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.07488
License (as archived)
CC0-1.0
Archived
2026-10-07T11:53:06.907Z
SHA-256 of the archived text
c9874677fb6be8621d693cbf6f70b3020f1242d33e4a1542aeda3a9562534530
Stable URL of this page
https://metraipolis.com/documento/dc_a2cbaccb4653

How to cite

Separating Path Systems of Size at most $7.75n$ — arXiv:2610.07488 — arXiv (en), https://arxiv.org/abs/2610.07488 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a2cbaccb4653 (Metraipolis archive dc_a2cbaccb4653, sha256 c9874677fb6be8621d693cbf6f70b3020f1242d33e4a1542aeda3a9562534530)
BibTeX
@misc{dca2cbaccb4653,
  title = {Separating Path Systems of Size at most $7.75n$ — arXiv:2610.07488},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.07488},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a2cbaccb4653; sha256 c9874677fb6be8621d693cbf6f70b3020f1242d33e4a1542aeda3a9562534530},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.07488. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A family of paths in a graph $G$ strongly separates the edges of $G$ if for every ordered pair of distinct edges $(e,f)$ some path in the family contains $e$ and avoids $f$; the minimum size of such a family is denoted by $\operatorname{ssp}(G)$. Bonamy, Botler, Dross, Naia, and Skokan proved, for every $n$-vertex graph $G$, that $\operatorname{ssp}(G)\le 19n$; Liu, Xu, and Yang recently improved this to $\operatorname{ssp}(G)\le 10n-o(n)$. We prove, for every $n$-vertex graph $G$, that $\operatorname{ssp}(G)\le 7.75n$.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.07488 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T11:22:09.542Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).