J. Leaños

collaborators

4 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…

math.CO2026

Corrections to classical results on Independence and Covering numbers of the Splitting graph

J. Castro, J. LeaÃ±os, O. Rosario

The splitting graph $S (G)$ of a finite simple graph $G$ was introduced by Sampathkumar and Walikar in 1980~\cite{SW1980} and has been extensively studied in relation to graph invar…

math.CO2026

An asymptotically tight upper bound for the domination number of the $2$ -token graph of path graphs

E. Acosta Troncoso, J. LeaÃ±os, L. M. Rivera

In this note, we show that the domination number of the $2$ -token graph of the path graph of order $n \geq 2$ is equal to $\frac{n ^{2}}{10} + I^ (n)$ .

math.CO2026

The 3-symmetric Pseudolinear Crossing Number of $K_{33}$

We show that the 3-symmetric rectilinear and the 3-symmetric pseudolinear crossing numbers of $K_{33}$ are equal. Specifically, we prove that $\operatorname{sym}-\overline{\operato…

Blow-ups of order types of positive density

Corrections to classical results on Independence and Covering numbers of the Splitting graph

An asymptotically tight upper bound for the domination number of the 2-token graph of path graphs

The 3-symmetric Pseudolinear Crossing Number of K33​

An asymptotically tight upper bound for the domination number of the $2$ -token graph of path graphs

The 3-symmetric Pseudolinear Crossing Number of $K_{33}$