549 problems
For graphs and , let be the least integer such that every red/blue coloring of the edges of the complete graph on vertices contains either a red copy of …
For an integer , let be the graph with vertex set , in which two vertices are adjacent exactly when they differ in one coordinate. Thus and…
Let and let a finite coloring of be given. Generalized Hindman's conjecture. There exist infinitely many such that all f…
Let denote the minimum integer such that every red-blue coloring of the edges of the complete graph on vertices contains a red copy of or a blue copy of…
For every integer , let be the least positive integer such that every coloring admits with and…
For the book graph consisting of triangles sharing a common edge, determine the asymptotic behavior of for each fixed . T…
For every integer , the book Ramsey number satisfies , where is the graph consisting of triangles sharing a common edge…
Determine precisely which ordered trees satisfy ; equivalently, characterize the ordered trees for which there exists a constant such that…
For every finite -uniform hypergraph , the off-diagonal Ramsey number is polynomially bounded in if and only if there exists an integer such that is…
For every integer , every edge-coloring contains a set with and a color such that…
Let be the least integer such that every graph on vertices contains either a complete subgraph isomorphic to or an independent set of size . The conjectur…
Characterize the sequences of positive real numbers such that, for every integer , there exists an integer with the following property:…
For every pair of integers and , and every -degenerate graph , does Builder have a strategy in the -color online Ramsey game that forces Painter to produc…
Let be an ordered forest on vertices, and let denote its interval chromatic number. Is there a constant such that every such satisfies … Here…
For every pair of integers , there exists a constant such that, for all sufficiently large integers , . Here…
Determine whether there exists an absolute constant such that, for every integer , there is a constant for which every weakly -degenerate ordered -unifo…
For , let be the set of Schur triples, and for a coloring let be the number of triples…
For every integer , every oriented graph with chromatic number contains every oriented tree on vertices as an oriented subgraph. Equivalently,…
For an odd integer , determine the least integer such that, for every integer and every tree on vertices, the Ramsey number satisfies…
For any fixed , for some constant .
For every with and , does there exist a set containing no non-trivial arithmetic progression of length , such that every…
Is there a function and a such that in any -colouring of the integers there exists a sequence such that for infinitely many and the set…
Let be a family of finite graphs such that for every there is some such that if the edges of are coloured with colours then there is a monochromatic tr…
Let be the smallest such that if the edges of are -coloured then there is a set of vertices which does not contain a copy of in at least one of th…
For every natural number , does there exist a finite set such that, for every coloring of with two colors, there is a subset satis…