Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Turán numbers

Sortuj według:

Ogranicz wyniki do:

One More Turán Number and Ramsey Number for the Loose 3-Uniform Path of Length Three

100%

Polcyn J.

Discussiones Mathematicae Graph Theory

2017

tom 37

nr 2

443-464

Let P denote a 3-uniform hypergraph consisting of 7 vertices a, b, c, d, e, f, g and 3 edges {a, b, c}, {c, d, e}, and {e, f, g}. It is known that the r-color Ramsey number for P is R(P; r) = r + 6 for r ≤ 9. The proof of this result relies on a careful analysis of the Turán numbers for P. In this paper, we refine this analysis further and compute the fifth order Turán number for P, for all n. Using this number for n = 16, we confirm the formula R(P; 10) = 16.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Polcyn J.

1 2017

Wyniki wyszukiwania

One More Turán Number and Ramsey Number for the Loose 3-Uniform Path of Length Three