Cover Image

The Nash-Williams orientation theorem for graphs with countably many ends

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Assem, Amena, Koloschin, Marcel, Pitz, Max
Format:	Preprint
Published:	2023
Subjects:	Combinatorics 05C20, 05C40, 05C63
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A metrization theorem for edge-end spaces of infinite graphs
by: Pitz, Max
Published: (2025)

A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
by: Erde, Joshua, et al.
Published: (2019)

Displaying prescribed sets of ends by linked tree-decompositions
by: Albrechtsen, Sandra, et al.
Published: (2025)

On order-compatible paths in infinite graphs
by: Pitz, Max, et al.
Published: (2026)

On tree-decompositions for infinite chordal graphs
by: Pitz, Max, et al.
Published: (2026)

Counterexamples regarding linked and lean tree-decompositions of infinite graphs
by: Albrechtsen, Sandra, et al.
Published: (2024)

Linked tree-decompositions into finite parts
by: Albrechtsen, Sandra, et al.
Published: (2024)

Menger's theorem for ends of digraphs
by: Reich, Florian
Published: (2026)

A star-comb lemma for infinite digraphs
by: Reich, Florian
Published: (2024)

Large flames in rooted acyclic digraphs without backward-infinite paths
by: Joó, Attila, et al.
Published: (2025)

A representation theorem for end spaces of infinite graphs
by: Kurkofka, Jan, et al.
Published: (2021)

Edge-ends versus topological ends of graphs
by: Aurichi, Leandro, et al.
Published: (2026)

Obstructions for normally spanned sets of vertices
by: Lorenz, Nicola, et al.
Published: (2025)

A topological characterization of end space of infinite graphs via games, subspaces and products
by: Aurichi, Leandro, et al.
Published: (2026)

All graphs are majority 3-choosable
by: Ouborny, Jan, et al.
Published: (2025)

Connectoids I: a universal end space theory
by: Bowler, Nathan, et al.
Published: (2024)

An end degree for digraphs
by: Hamann, Matthias, et al.
Published: (2024)

Ubiquity of oriented rays
by: Gut, Florian, et al.
Published: (2022)

On the ubiquity of oriented double rays
by: Gut, Florian, et al.
Published: (2023)

Halin's grid theorem for digraphs
by: Reich, Florian
Published: (2024)

Tangle-tree duality in infinite graphs
by: Albrechtsen, Sandra
Published: (2024)

A note on uncountably chromatic graphs
by: Bowler, Nathan, et al.
Published: (2024)

The classification of homomorphism homogeneous oriented graphs
by: Pavlica, Bojana, et al.
Published: (2024)

A generalisation of Menger's theorem in bidirected graphs
by: Ghorbani, Ebrahim, et al.
Published: (2025)

The immersion-minimal infinitely edge-connected graph
by: Knappe, Paul, et al.
Published: (2022)

Connectoids II: existence of normal trees
by: Bowler, Nathan, et al.
Published: (2024)

Circuits through prescribed edges
by: Knappe, Paul, et al.
Published: (2018)

Refining tree-decompositions so that they display the k-blocks
by: Albrechtsen, Sandra
Published: (2024)

Normal trees of digraphs
by: Reich, Florian
Published: (2024)

On ubiquity problems in infinite digraphs
by: Hamann, Matthias, et al.
Published: (2026)

A Simple Construction of Tournaments with Finite and Uncountable Dichromatic Number
by: Sadhukhan, Arpan
Published: (2024)

The typical structure of oriented graphs and digraphs with forbidden blow-up of transitive tournaments
by: Liu, Jianxi
Published: (2026)

On orientations preserving edge-connectivity in infinite graphs
by: Aurichi, Leandro, et al.
Published: (2025)

Efficiently distinguishing all tangles in locally finite graphs
by: Jacobs, Raphael W., et al.
Published: (2023)

A coarse Halin Grid Theorem with applications to quasi-transitive, locally finite graphs
by: Albrechtsen, Sandra, et al.
Published: (2025)

Remarks on the countable case of the Unfriendly Partition Problem
by: Aurichi, Leandro Fiorini, et al.
Published: (2024)

Infinite random graphs
by: Kostana, Ziemowit, et al.
Published: (2026)

Infinite grids in digraphs
by: Hamann, Matthias, et al.
Published: (2024)

Canonical graph decompositions via coverings
by: Diestel, Reinhard, et al.
Published: (2022)

Trivial coloring of Cartesian product of graphs
by: Csernák, Tamás
Published: (2023)