|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'928
Articles rated: 2609
25 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Mader's conjecture for graphs with small connectivity | | Yanmei Hong
; Qinghai Liu
; | | Date: |
28 Jan 2021 | | Abstract: | Mader conjectured that for any tree $T$ of order $m$, every $k$-connected
graph $G$ with minimum degree at least $lfloorfrac{3k}{2}
floor +m-1$
contains a subtree $T’cong T$ such that $G-V(T’)$ is $k$-connected. In this
paper, we give a characterization for a subgraph to contain an embedding of a
specified tree avoiding some vertex. As a corollary, we confirm Mader’s
conjecture for $kleq3$. | | Source: | arXiv, 2101.11777 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
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 Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER