26 citations · 34 across the 21 of their papers we have counts for
1 paper · 2 filters
Alistair Benford, Louis DeBiasio, Paul Larson
We prove a strong dichotomy result for countably-infinite oriented graphs; that is, we prove that for all countably-infinite oriented graphs G, either (i) there is a countably-in…