R. Fabila-Monroy

collaborators

5 papers

math.CO2026

Blow-ups of order types of positive density

Ruy Fabila-Monroy, Benedikt Hahn, JesÃºs LeaÃ±os

Order types are an equivalence relation between point configurations that capture their combinatorial and convexity properties. Let $P$ be a $I^º$ -colored sequence of $n \geq d + 1$ po…

cs.CG2025

The Euclidean $k$ -Matching Problem is NP-hard

JosÃ©-Miguel DÃaz-BÃ¡Ã±ez, Ruy Fabila-Monroy, JosÃ©-Manuel Higes-LÃ³pez +3

Let $G$ be a complete edge-weighted graph on $n$ vertices. To each subset of vertices of $G$ assign the cost of the minimum spanning tree of the subset as its weight. Suppose that…

math.CO2025

Domination number of Token Graphs

Ruy Fabila-Monroy, Sergio Gerardo GÃ³mez-Galicia

The $k$ -token graph of $G$ is the graph, $F_{k} (G)$ , whose vertices are all the $k$ -subsets of $V (G)$ ; with two of them adjacent whenever their symmetric difference is a pair of adja…

math.CO2025

On the Treewidth of Token and Johnson Graphs

Let $G$ be a graph on $n$ vertices and $1 \leq k \leq n$ a fixed integer. The \textit{ $k$ -token graph} of $G$ is the graph $F_{k} (G)$ whose vertex set consists of all $k$ -subsets of th…

math.CO2025

On the rectilinear crossing number of complete balanced multipartite graphs and layered graphs

Ruy Fabila-Monroy, Rosna Paul, Jenifer Viafara-Chanchi +1

A rectilinear drawing of a graph is a drawing of the graph in the plane in which the edges are drawn as straight-line segments. The rectilinear crossing number of a graph is the mi…

Blow-ups of order types of positive density

The Euclidean k-Matching Problem is NP-hard

Domination number of Token Graphs

On the Treewidth of Token and Johnson Graphs

On the rectilinear crossing number of complete balanced multipartite graphs and layered graphs

The Euclidean $k$ -Matching Problem is NP-hard