12 problems

Rainbow anti-Ramsey conjecture. The rainbow anti-Ramsey number for $(t+2)$ vertex-disjoint triangles satisfies

Keevash–Mubayi–Sudakov–Verstraëte conjecture. There is a constant $C$ such that every properly edge-colored $n$-vertex graph with at least $Cn\log n$ edges contains a rainbow cycle…

Let $G$ be an edge-colored graph on $n$ vertices, let $e(G)$ denote its number of edges, and let $c(G)$ denote its number of colors. A proper $mK_3$ is a collection of $m$ vertex-d…

Let $S(N)$ be the set of natural numbers $q$ such that $4\leq q\leq N$ and, for every $n_0$, there is some $n\geq n_0$ with $n\equiv 1\pmod{\ell}$ and a balanced coloring of $K_n$…

Rainbow induced-path conjecture. For each $r\geq 3$, every properly coloured $K_r$-free graph of chromatic number $\chi$ contains a rainbow induced path of length $\chi^{1/(r-2)}$.

Let $G$ be an edge-colored graph of order $n$, and let $c(G)$ denote the number of colors appearing on its edges. Erdős–Simonovits–Sós conjecture. For all $n\geq k\geq 3$, if … the…

Extremal characterization conjecture. If $D$ contains no rainbow triangles and

Constant-error rainbow tree conjecture. There is a constant $C$ such that every properly coloured $K_n$ has a rainbow copy of every tree on $n-C$ vertices.

Let $K_k$ be the complete graph on $k$ vertices, let $\mathcal{R}(K_k)$ be the family of rainbow edge-colorings of $K_k$, and let $\operatorname{sat}_t(n,\mathcal{R}(K_k))$ denote…

Let $P_n$ and $C_n$ denote, respectively, the path and cycle on $n$ vertices, and let $\rho_R(G)$ denote the replication number of a graph $G$. The cycle–path replication conjectur…

Let $P_n$ be the path on $n$ vertices, and let $\rho_R(P_n)$ denote its replication number. The notation $O(n)$ means a quantity bounded in absolute value by a constant multiple of…

Let $P_n$ be the path on $n$ vertices, and let $\rho_R(P_n)$ denote its replication number. For odd $n\geq 1$, write the upper-bound formula according to the residue class of $n$ m…