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 2024Show all

3 papers · 1 filter

math.CO2024

Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs

F. Botler, Y. S. Couto, C. G. Fernandes +4

Chernyshev, Rauch, and Rautenbach proved that every connected graph on $n$ vertices with less than $\frac{11}{5} n - \frac{18}{5}$ edges has a vertex cut that induces a forest, and co…

math.CO2024

Ramsey Goodness of paths and unbalanced graphs

Fábio Botler, Luiz Moreira, João Pedro de Souza

Given graphs $G$ and $H$ , we say that $G$ is $H$ - $g oo d$ if the Ramsey number $R (G, H)$ equals the trivial lower bound $(∣ G ∣ - 1) (χ (H) - 1) + σ (H)$ , where $χ (H)$ denotes the usual ch…

math.CO2024

Separating the edges of a graph by cycles and by subdivisions of $K_{4}$

Fábio Botler, Tássio Naia

A separating system of a graph $G$ is a family $S$ of subgraphs of $G$ for which the following holds: for all distinct edges $e$ and $f$ of $G$ , there exists an element i…

Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs

Ramsey Goodness of paths and unbalanced graphs

Separating the edges of a graph by cycles and by subdivisions of K4​

Separating the edges of a graph by cycles and by subdivisions of $K_{4}$