4 ms·
Is this true? I mean, consider the infinite directed graph generated by the total ordering of ℤ, then all vertices have indegree and outdegree one (by definitio
by LolWolf 8y ago
Is this true? I mean, consider the infinite directed graph generated by the total ordering of ℤ, then all vertices have indegree and outdegree one (by definition of a total ordering), so there is such an infinite path. Are there some further restrictions on this graph?
- LolWolf 8y agoI just read you paper, it’s quite fun! This comment was made with the belief that you claimed that all infinite graphs have this property. Anyways, I know it’s an old thread, but if anyone is reading this, I highly recommend reading it. Here is the paper: https://arxiv.org/pdf/1201.2869.pdf https://arxiv.org/pdf/1201.2869.pdf