Abstract
Given integers , the th power of the path is the ordered graph with vertex set , and all edges of the form where . The ramsey number is the minimum such that every 2-coloring of results in a monochromatic copy of . It is well-known that . For , Balko-Cibulka-Král-Kynčl proved that and asked for the growth rate for fixed . When , we improve this upper bound by proving . Using this result, we determine the correct tower growth rate of the -uniform hypergraph ramsey number of a -clique versus an ordered tight path. Finally, we consider an ordered version of the classical Erd Hos-Hajnal hypergraph ramsey problem, improve the tower height given by the trivial upper bound, and conjecture that this tower height is optimal.
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.