Corpus ID: 237532120

On mixed and irredundant Ramsey numbers

@inproceedings{Ji2021OnMA,
  title={On mixed and irredundant Ramsey numbers},
  author={Meng Ji and Yaping Mao and Ingo Schiermeyer},
  year={2021}
}
A set of vertices $X\subseteq V$ in a simple graph $G(V,E)$ is irredundant if each vertex $x\in X$ is either isolated in the induced subgraph $\langle X\rangle$ or else has a private neighbor $y\in V\setminus X$ that is adjacent to $x$ and to no other vertex of $X$. The \emph{irredundant Ramsey number} $s(m,n)$ is the smallest $N$ such that in every red-blue coloring of the edges of the complete graph of order $N$, either the blue subgraph contains an $m$-element irredundant set or the red… Expand

Figures from this paper