Re:The Erdos Paradox
by LolWolf on Friday January 04, 2019 @11:07AM
(#18824995)
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?
[ Parent
| on HN ]
I 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