Tur\'an's problem for trees $T_n$ with maximal degree $n-4$

For $n \geq 6$ let $V = {v_{0}, v_{1}, \dots, v_{n - 1}}$ , $E_{1} = {v_{0} v_{1}, \dots, v_{0} v_{n - 4}, v_{1} v_{n - 3}, v_{1} v_{n - 2}$ , $v_{1} v_{n - 1}}$ , $E_{2} = {v_{0} v_{1}, \dots, v_{0} v_{n - 4}, v_{1} v_{n - 3}, v_{1} v_{n - 2}, v_{2} v_{n - 1}}$ , $E_{3} = {v_{0} v_{1}, \dots, v_{0} v_{n - 4}$ , $v_{1} v_{n - 3}, v_{2} v_{n - 2}, v_{3} v_{n - 1}}$ , $T_{n}^{3} = (V, E_{1}), T_{n}^{^{''}} = (V, E_{2})$ and $T_{n}^{^{'''}} = (V, E_{3}) .$ In this paper, for $p \geq n \geq 15$ we obtain explicit formulas for $e x (p; T_{n}^{3})$ , $e x (p; T_{n}^{^{''}})$ and $e x (p; T_{n}^{^{'''}})$ , where $e x (p; L)$ denotes the maximal number of edges in a graph of order $p$ not containing $L$ as a subgraph.

Tur\'an's problem for trees $T_{n}$ with maximal degree $n - 4$

文献摘要

讨论

讲解博客

AI智能校验

Tur\'an's problem for trees $T_{n}$ with maximal degree $n - 4$

文献摘要

讨论

讲解博客

AI智能校验

Tur\'an's problem for trees TnTn​ with maximal degree n−4n−4

文献摘要

讨论

|讲解博客

|AI智能校验

Tur\'an's problem for trees TnTn​ with maximal degree n−4n−4

文献摘要

讨论

|讲解博客

|AI智能校验

Tur\'an's problem for trees $T_{n}$ with maximal degree $n - 4$

讲解博客

AI智能校验

Tur\'an's problem for trees $T_{n}$ with maximal degree $n - 4$

讲解博客

AI智能校验