Open AccessThe Turàn number of the graph 3P4
Author(s) -
Halina Bielak,
Sebastian Kieliszek
Publication year - 2014
Publication title -
annales universitatis mariae curie-skłodowska. sectio a, mathematica
Language(s) - English
Resource type - Journals
eISSN - 2083-7402
pISSN - 0365-1029
DOI - 10.2478/umcsmath-2014-0003
Subject(s) - combinatorics , graph , mathematics , discrete mathematics
Let ex (n,G) denote the maximum number of edges in a graph on n vertices which does not contain G as a subgraph. Let P