Towards Nash‐Williams orientation conjecture for infinite graphs

Abstract In 1960 Nash‐Williams proved that an edge‐connectivity of is sufficient for a finite graph to have a ‐arc‐connected orientation. He then conjectured that the same is true for infinite graphs. In 2016, Thomassen, using his own results on the auxiliary lifting graph , proved that ‐edge‐connected infinite graphs admit a ‐arc‐connected orientation. Here we improve this result for the class of one‐ended locally finite graphs and show that an edge‐connectivity of is enough in that case. Crucial to this improvement are results presented in a separate paper, by the same author of this paper, on the key concept of the lifting graph, extending results by Ok, Richter, and Thomassen.

Authors

Institutions

Publication Details

Journal
Journal of Graph Theory
Published
2024-10-08
DOI
https://doi.org/10.1002/jgt.23192
Citations
2
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.72

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Towards Nash‐Williams orientation conjecture for infinite graphs

Amena Assem
2 citations
Journal of Graph Theory
Advanced Graph Theory Research
0.72
article

Towards Nash‐Williams orientation conjecture for infinite graphs

Amena Assem
article en
2 citations

Abstract

Abstract In 1960 Nash‐Williams proved that an edge‐connectivity of is sufficient for a finite graph to have a ‐arc‐connected orientation. He then conjectured that the same is true for infinite graphs. In 2016, Thomassen, using his own results on the auxiliary lifting graph , proved that ‐edge‐connected infinite graphs admit a ‐arc‐connected orientation. Here we improve this result for the class of one‐ended locally finite graphs and show that an edge‐connectivity of is enough in that case. Crucial to this improvement are results presented in a separate paper, by the same author of this paper, on the key concept of the lifting graph, extending results by Ok, Richter, and Thomassen.

Journal of Graph TheoryVol. 108(3)
University of Waterloo (CA)
Natural Sciences and Engineering Research Council of Canada
Openalex Percentile: Top 26%
Advanced Graph Theory Research
0.72
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.