| | |
| | |
Stat |
Members: 3645 Articles: 2'503'724 Articles rated: 2609
23 April 2024 |
|
| | | |
|
Article overview
| |
|
Tur'an's problem for trees $T_n$ with maximal degree $n-4$ | Zhi-Hong Sun
; Yin-Yin Tu
; | Date: |
27 Oct 2014 | Abstract: | For $nge 6$ let $V={v_0,v_1,ldots,v_{n-1}}$,
$E_1={v_0v_1,ldots,v_0v_{n-4},v_1v_{n-3},v_1v_{n-2}$, $v_1v_{n-1}}$,
$E_2={v_0v_1,ldots,v_0v_{n-4},v_1v_{n-3},v_1v_{n-2},v_2v_{n-1}}$,
$E_3={v_0v_1,ldots,v_0v_{n-4}$, $v_1v_{n-3},v_2v_{n-2},v_3v_{n-1}}$,
$T_n^3=(V,E_1), T_n^{’’}=(V,E_2)$ and $T_n^{’’’} =(V,E_3).$ In this paper, for
$pge nge 15$ we obtain explicit formulas for $ex(p;T_n^3)$, $ex(p;T_n^{’’})$
and $ex(p;T_n^{’’’})$, where $ex(p;L)$ denotes the maximal number of edges in a
graph of order $p$ not containing $L$ as a subgraph. | Source: | arXiv, 1410.7282 | 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:
| |