F. Benevides

activity

20132026

most citedThe number of Gallai k-colorings of complete graphs

3 citations · 6 across the 7 of their papers we have counts for

collaborators

Showing 2026Show all

2 papers · 1 filter

math.CO2026

Counting edge-colorings of a complete graph avoiding a rainbow $K_{4}$

Fabricio S. Benevides, Josefran de O. Bastos

For $k, r, n$ natural numbers let $ρ_{r, k} (K_{n})$ be the number of $r$ -edge-colorings of $K_{n}$ that do not contain a rainbow copy of a $K_{k}$ , that is, a copy of $K_{k}$ in which all e…

math.CO2026

Gallai 3-colourings of random graphs

Fabrício S. Benevides, Rubens C. S. Monteiro, Guilherme O. Mota

A Gallai $k$ -colouring of a graph $G$ is a colouring of $E (G)$ with $k$ colours that induces no rainbow triangles, that is, a triangle with edges of 3 different colours. We give a…

Counting edge-colorings of a complete graph avoiding a rainbow K4​

Gallai 3-colourings of random graphs

Counting edge-colorings of a complete graph avoiding a rainbow $K_{4}$