相关论文: Generalized Ramsey numbers: forbidding paths with …

Given graphs $H_1,H_2$, a graph $G$ is $(H_1,H_2)$-Ramsey if for every colouring of the edges of $G$ with red and blue, there is a red copy of $H_1$ or a blue copy of $H_2$. In this paper we investigate Ramsey questions in the setting of…

In this note we consider a Ramsey property of random $d$-regular graphs, $\mathcal{G}(n,d)$. Let $r\ge 2$ be fixed. Then w.h.p. the edges of $\mathcal{G}(n, 2r)$ can be colored such that every monochromatic component has size $o(n)$. On the…

Let the grid graph $G_{M\times N}$ denote the Cartesian product $K_M \square K_N$. For a fixed subgraph $H$ of a grid, we study the off-diagonal Ramsey number $\operatorname{gr}(H, K_k)$, which is the smallest $N$ such that any red/blue…

A proper total colouring of a graph $G$ is called harmonious if it has the further property that when replacing each unordered pair of incident vertices and edges with their colours, then no pair of colours appears twice. The smallest…

For a graph $H$ and an integer $k\ge1$, the $k$-color Ramsey number $R_k(H)$ is the least integer $N$ such that every $k$-coloring of the edges of the complete graph $K_N$ contains a monochromatic copy of $H$. Let $C_m$ denote the cycle on…

Let $P_k$ be a path, $C_k$ a cycle on $k$ vertices, and $K_{k,k}$ a complete bipartite graph with $k$ vertices on each side of the bipartition. We prove that (1) for any integers $k, t>0$ and a graph $H$ there are finitely many subgraph…

Let $R_h(k; \ell)$ be the smallest integer $n$ such that any edge coloring of a complete graph on $n$ vertices in $\ell$ colors results in a monochromatic $K_k$-minor, in other words, a graph with Hadwiger number $k$, i.e., a graph that…

A well-studied coloring problem is to assign colors to the edges of a graph $G$ so that, for every pair of vertices, all edges of at least one shortest path between them receive different colors. The minimum number of colors necessary in…

An ordered graph $G$ is a graph together with a specified linear ordering on the vertices, and its interval chromatic number is the minimum number of independent sets consisting of consecutive vertices that are needed to partition the…

For graphs G and H, let the induced Ramsey number IR(H,G) be the smallest number of vertices in a graph F such that any coloring of the edges of F in red and blue, there is either a red induced copy of H or a blue induced copy of G. In this…

In a graph whose edges are colored, a parity walk is a walk that uses each color an even number of times. The parity edge chromatic number p(G) of a graph G is the least k so that there is a coloring of E(G) using k colors that does not…

Let $H$ be a $k$-edge-coloured graph and let $n$ be a positive integer. What is the maximum number of copies of $H$ in a $k$-edge-coloured complete graph on $n$ vertices? This paper studies the case $k=2$, which we call the…

Our goal is to investigate a close relative of the independent transversal problem in the class of infinite $K_n$-free graphs: we show that for any infinite $K_n$-free graph $G=(V,E)$ and $m\in \mathbb N$ there is a minimal $r=r(G,m)$ such…

For graphs $F$, $G$, and $H$, we write $F \to (G,H)$ if every red-blue coloring of the edges of $F$ produces a red copy of $G$ or a blue copy of $H$. The graph $F$ is said to be $(G,H)$-minimal if it is subgraph-minimal with respect to this…

For given graphs $G$ and $H,$ the \emph{Ramsey number} $R(G,H)$ is the least natural number $n$ such that for every graph $F$ of order $n$ the following condition holds: either $F$ contains $G$ or the complement of $F$ contains $H.$ In this…

In his study of graph codes, Alon introduced the concept of the odd-Ramsey number of a family of graphs $\mathcal{H}$ in $K_n$, defined as the minimum number of colours needed to colour the edges of $K_n$ so that every copy of a graph $H\in…

Let $K\_{[k,t]}$ be the complete graph on $k$ vertices from which a set of edges, induced by a clique of order $t$, has been dropped. In this note we give two explicit upper bounds for $R(K\_{[k\_1,t\_1]},\dots, K\_{[k\_r,t\_r]})$ (the…

Given integers $p, q\ge2$, we say that a graph $G$ is $(K_p,K_q)$-free if there exists a red/blue edge coloring of $G$ such that it contains neither a red $K_p$ nor a blue $K_q$. Fix a function $f( n )$, the Ramsey-Tur\'{a}n number $RT(…

We study a generalisation of Vizing's theorem, where the goal is to simultaneously colour the edges of graphs $G_1,\dots,G_k$ with few colours. We obtain asymptotically optimal bounds for the required number of colours in terms of the…

A path $v_1,v_2,\ldots,v_m$ in a graph $G$ is $degree$-$monotone$ if $deg(v_1) \leq deg(v_2) \leq \cdots \leq deg(v_m)$ where $deg(v_i)$ is the degree of $v_i$ in $G$. Longest degree-monotone paths have been studied in several recent…