Year: 2025
Type: article
Abstract: ABSTRACT We prove that in any ‐vertex complete graph, there is a collection of paths that strongly separates any pair of distinct edges , meaning that there is a path in , which contains but not . Furthermore, for certain classes of ‐vertex ‐regular graphs, we find a collection of paths that strongly separates any pair of edges. Both results are best‐possible up to the term.
Source: Random Structures and Algorithms
DOI: 10.1002/rsa.70006
Institutions: Universidade de São Paulo, University of Concepción
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4410032898