Abstract
Let denote a 3-uniform hypergraph consisting of 7 vertices and 3 edges and . It is known that the -color Ramsey number for is for . The proof of this result relies on a careful analysis of the Turán numbers for . In this paper, we refine this analysis further and compute the fifth order Turán number for , for all . Using this number for , we confirm the formula .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.