Science-advisor
REGISTER info/FAQ
Login
username
password
     
forgot password?
register here
 
Research articles
  search articles
  reviews guidelines
  reviews
  articles index
My Pages
my alerts
  my messages
  my reviews
  my favorites
 
 
Stat
Members: 3643
Articles: 2'487'895
Articles rated: 2609

29 March 2024
 
  » arxiv » 1705.0479

 Article overview


Highly connected infinite digraphs without edge-disjoint back and forth paths between a certain vertex pair
Attila Joó ;
Date 1 May 2017
AbstractWe construct for all $ kin mathbb{N} $ a $ k $-edge-connected digraph $ D $ with $ s,tin V(D) $ such that there are no edge-disjoint $ s ightarrow t $ and $t ightarrow s $ paths. We use in our construction "self-similar" graphs which technique could be useful in other problems as well.
Source arXiv, 1705.0479
Services Forum | Review | PDF | Favorites   
 
Visitor rating: did you like this article? no 1   2   3   4   5   yes

No review found.
 Did you like this article?

This article or document is ...
important:
of broad interest:
readable:
new:
correct:
Global appreciation:

  Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.

browser claudebot






ScienXe.org
» my Online CV
» Free


News, job offers and information for researchers and scientists:
home  |  contact  |  terms of use  |  sitemap
Copyright © 2005-2024 - Scimetrica