Geodesic
The Turán number of the graph 3p 5
Filomat, Tome 34 (2020) no. 10, p. 3395

Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

DOI

The Turán number ex(n, H) of a graph H, is the maximum number of edges in a graph of order n which does not contain H as a subgraph. Let Ex(n, H) denote all H-free graphs on n vertices with ex(n, H) edges. Let P i denote a path consisting of i vertices, and mP i denote m disjoint copies of P i. In this paper, we give the Turán number ex(n, 3P 5) for all positive integers n, which partly solve the conjecture proposed by L. Yuan and X. Zhang [7]. Moreover, we characterize all extremal graphs of 3P 5 denoted by Ex(n, 3P 5).
DOI : 10.2298/FIL2010395F
Classification : 05C35, 05C38
Keywords: Turán number, extremal graph, disjoint paths 
Liquan Feng; Yumei Hu. The Turán number of the graph 3p 5. Filomat, Tome 34 (2020) no. 10, p. 3395 . doi: 10.2298/FIL2010395F
@article{10_2298_FIL2010395F,
     author = {Liquan Feng and Yumei Hu},
     title = {The {Tur\'an} number of the graph 3p 5},
     journal = {Filomat},
     pages = {3395 },
     year = {2020},
     volume = {34},
     number = {10},
     doi = {10.2298/FIL2010395F},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.2298/FIL2010395F/}
}
TY  - JOUR
AU  - Liquan Feng
AU  - Yumei Hu
TI  - The Turán number of the graph 3p 5
JO  - Filomat
PY  - 2020
SP  - 3395 
VL  - 34
IS  - 10
UR  - http://geodesic.mathdoc.fr/articles/10.2298/FIL2010395F/
DO  - 10.2298/FIL2010395F
LA  - en
ID  - 10_2298_FIL2010395F
ER  - 
%0 Journal Article
%A Liquan Feng
%A Yumei Hu
%T The Turán number of the graph 3p 5
%J Filomat
%D 2020
%P 3395 
%V 34
%N 10
%U http://geodesic.mathdoc.fr/articles/10.2298/FIL2010395F/
%R 10.2298/FIL2010395F
%G en
%F 10_2298_FIL2010395F

Cité par Sources :