3 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
For a graph $H$, its $k$-colour vertex Ramsey class is the set of all graphs $G$ such that any colouring of the vertices of $G$ in $k$ colours results in a monochromatic (induced) copy of $H$. We prove that for any $k$, Ramsey classes of any non-isomorphic graphs are distinct.
For a graph $H$, let $\operatorname{ex}(Q_n, H)$ be the largest number of edges in a subgraph of the hypercube $Q_n$ of dimension $n$ that contains no subgraph isomorphic to $H$. The Tur\'an density of $H$ in a hypercube, denoted $\pi_\square(H)$, is defined as $\lim_{n\rightarrow \infty} \operatorname{ex}(Q_n, H)/|E(Q...
For graphs $G,H$ and positive integers $r$ and $n$ we write $G^{\square n} \xrightarrow{r} H$ if every $r$-vertex-coloring of the Cartesian power $G^{\square n}$ of $G$ contains a monochromatic copy of $H$. Since chromatic number $\chi$ of $G^{\square n}$ is the same as $\chi(G)$, there is an $r$-vertex coloring of $G^...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
