Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

The Turán Number of the Graph 2P5

100%

Bielak H., Kieliszek S.

Discussiones Mathematicae Graph Theory

2016

tom 36

nr 3

683-694

We give the Turán number ex (n, 2P5) for all positive integers n, improving one of the results of Bushaw and Kettle [Turán numbers of multiple paths and equibipartite forests, Combininatorics, Probability and Computing, 20 (2011) 837-853]. In particular we prove that ex (n, 2P5) = 3n−5 for n ≥ 18.

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

The Turán number of the graph \(3P_4\)

100%

Bielak H., Kieliszek S.

Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica

2014

tom 68

nr 1

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_i\) denote a path consisting of \(i\) vertices and let \(mP_i\) denote \(m\) disjoint copies of \(P_i\). In this paper we count \(ex(n, 3P_4)\).

Ograniczanie wyników

1 Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica

1 Discussiones Mathematicae Graph Theory

2 Bielak H.

2 Kieliszek S.

1 2016

1 2014

Wyniki wyszukiwania

The Turán Number of the Graph 2P5

The Turán number of the graph \(3P_4\)