12 citations · 40 across the 27 of their papers we have counts for
4 papers · 1 filter
What is Ramsey-equivalent to a clique?
Jacob Fox, Andrey Grinshpun, Anita Liebenau +2
A graph G is Ramsey for H if every two-colouring of the edges of G contains a monochromatic copy of H. Two graphs H and H' are Ramsey-equivalent if every graph G is Ramsey for H if…
On the multicolor Ramsey number of a graph with m edges
Kathleen Johst, Yury Person
The multicolor Ramsey number of a graph is the least integer such that in every coloring of the edges of by colors there is a monochromatic copy of .…
On the rank of higher inclusion matrices
Codrut Grosu, Yury Person, Tibor Szabo
Let r >= s >= 0 be integers and G be an r-graph. The higher inclusion matrix M_s^r(G) is a {0,1}-matrix with rows indexed by the edges of G and columns indexed by the subsets of V(…
Tight Hamilton cycles in random hypergraphs
Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa +1
We give an algorithmic proof for the existence of tight Hamilton cycles in a random r-uniform hypergraph with edge probability p=n^{-1+eps} for every eps>0. This partly answers a q…