Re: Paths

On 14 Mai, 22:26, Virgil <vir...@xxxxxxxxxxx> wrote:

Could less be formulated?
(4) shows that never more than one path is required, no?

For a set of paths to cover the nodes of any path p in a CIBT without
including p itself, an infinite set of paths is required.

That is your dream, but it is not reality. I can show that no path of
your infinte set is required. I can show that no path of your set is
sufficient.

Regards, WM

.