F. Botler

activity

20152025

most citedSeparating the edges of a graph by a linear number of paths

9 citations · 33 across the 19 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

math.CO2022

Seymour's Second Neighborhood Conjecture for orientations of (pseudo)random graphs

Fábio Botler, Phablo F. S. Moura, Tássio Naia

Seymour's Second Neighborhood Conjecture (SNC) states that every oriented graph contains a vertex whose second neighborhood is as large as its first neighborhood. We investigate th…

math.CO2022

The $mod k$ chromatic index of random graphs

Fábio Botler, Lucas Colucci, Yoshiharu Kohayakawa

The $mod k$ chromatic index of a graph $G$ is the minimum number of colors needed to color the edges of $G$ in a way that the subgraph spanned by the edges of each color has…

Seymour's Second Neighborhood Conjecture for orientations of (pseudo)random graphs

The modk chromatic index of random graphs

The $mod k$ chromatic index of random graphs