Dionatan R. Schmidt

collaborators

2 papers

math.CO2025

Maximum number of edge colorings avoiding rainbow copies of $K_{4}$

Hiêp Hàn, Carlos Hoppen, Nicolas Moro Müller +1

In this paper we show that for $r \geq 12$ and any sufficiently large $n$ -vertex graph $G$ the number of $r$ -edge-colorings of $G$ with no rainbow $K_{4}$ is at most $r^{e x (n, K_{4})}$ ,…

math.CO2022

Edge-colorings avoiding patterns in a triangle

Carlos Hoppen, Hanno Lefmann, Dionatan Ricardo Schmidt

For positive integers $n$ and $r$ , we consider $n$ -vertex graphs with the maximum number of $r$ -edge-colorings with no copy of a triangle where exactly two colors appear. We prove…

Maximum number of edge colorings avoiding rainbow copies of K4​

Edge-colorings avoiding patterns in a triangle

Maximum number of edge colorings avoiding rainbow copies of $K_{4}$