We show that for each natural number n the clique Kₙ has a weakly separating path system of size $n+2$, improving the previous best known upper bound of $(1+o(1))n$. Since $n-1$ is a lower bound, this is almost tight.
No takes yet. Share an insight, caveat, or question.
Kontogeorgiou et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: