Orientations of infinite graphs
Combinatorics
2021-04-21 v2
Abstract
Building on recent work by Thomassen, we show that Nash-Williams' orientation theorem, that every finite -edge-connected multigraph has a -arc-connected orientation, also holds for all infinite multigraphs.
Keywords
Cite
@article{arxiv.2011.05936,
title = {Orientations of infinite graphs},
author = {Marcel Koloschin and Max Pitz},
journal= {arXiv preprint arXiv:2011.05936},
year = {2021}
}
Comments
We thought we had a proof that every 2k-edge-connected graph has a k-strong edge-connected orientation, however we currently only get a bound of 4k. The mistake lies in Theorem 2.1