| | |
| | |
Stat |
Members: 3645 Articles: 2'506'133 Articles rated: 2609
26 April 2024 |
|
| | | |
|
Article overview
| |
|
Tur'an's Problem for Trees | Zhi-Hong Sun
; Lin-Lin Wang
; | Date: |
27 Oct 2014 | Abstract: | For a forbidden graph $L$, let $ex(p;L)$ denote the maximal number of edges
in a simple graph of order $p$ not containing $L$. Let $T_n$ denote the unique
tree on $n$ vertices with maximal degree $n-2$, and let $T_n^*=(V,E)$ be the
tree on $n$ vertices with $V={v_0,v_1,ldots,v_{n-1}}$ and
$E={v_0v_1,ldots,v_0v_{n-3},v_{n-3}v_{n-2},v_{n-2}v_{n-1}}$. In the paper
we give exact values of $ex(p;T_n)$ and $ex(p;T_n^*)$. | Source: | arXiv, 1410.7213 | 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:
| |