Re: Not constructive proof of existing of an algorithm



I somehow get the idea. Then we fall into another assumption that
sounds intuitive:

For fixed $d$, the set of "problematic subgraphs" can be computed in
finite steps only depend on $d$.

But I am curious about this assumption.

regards,
yalding

.



Relevant Pages