Highly Connected Infinite Digraphs Without Edge‐Disjoint Back and Forth Paths Between a Certain Vertex Pair |
| |
| Authors: | Attila Joó |
| |
| Affiliation: | MTA‐ELTE EGERVáRY RESEARCH GROUP, DEPARTMENT OF COMPUTER SCIENCE, E?TV?S LORóND UNIVERSITY, BUDAPEST, HUNGARY |
| |
| Abstract: | We construct for all  a k‐edge‐connected digraph D with  such that there are no edge‐disjoint  and  paths. We use in our construction “self‐similar” graphs which technique could be useful in other problems as well. |
| |
| Keywords: | edge‐connectivity infinite graph self similar counterexample |
|
|
a k‐edge‐connected digraph D with 
such that there are no edge‐disjoint 
and 
paths. We use in our construction “self‐similar” graphs which technique could be useful in other problems as well.