Zobrazeno 1 - 10
of 188
pro vyhledávání: '"Fabila Monroy, Ruy"'
Autor:
Fabila-Monroy, Ruy, Gómez-Galicia, Sergio Gerardo, Gregorio-Longino, Daniel, Hoekstra-Mendoza, Teresa I., Trujillo-Negrete, Ana
Let $G$ be a connected graph on $n$ vertices and $1 \le k \le n-1$ an integer. The $k$-token graph of $G$ is the graph $F_k(G)$ whose vertices are all the $k$-subsets of vertices of $G$, two of which are adjacent whenever their symmetric difference i
Externí odkaz:
http://arxiv.org/abs/2408.04059
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 minimum number of pairs of edges that cross over all rectilinear drawing
Externí odkaz:
http://arxiv.org/abs/2404.13155
The use of drones or Unmanned Aerial Vehicles (UAVs) for aerial photography and cinematography is becoming widespread. The following optimization problem has been recently considered. Let us imagine a sporting event where a group of runners are compe
Externí odkaz:
http://arxiv.org/abs/2403.14033
Autor:
Fabila-Monroy, Ruy, Gómez-Galicia, Sergio Gerardo, Hernández-Cruz, César, Trujillo-Negrete, Ana Laura
Let $G$ be a graph on $n$ vertices and $1 \le k \le n$ a fixed integer. The $k$-token graph of $G$ is the graph, $F_k(G)$, whose vertex set is equal to all the $k$-subsets of $V(G)$; where two of them are adjacent whenever their symmetric difference
Externí odkaz:
http://arxiv.org/abs/2402.17962
Let $G$ be a graph on $n$ vertices and $S$ a subset of vertices of $G$; the boundary of $S$ is the set, $\partial S$, of edges of $G$ connecting $ S $ to its complement in $G$. The isoperimetric number of $G$, is the minimum of $\left| \partial S \ri
Externí odkaz:
http://arxiv.org/abs/2312.03114
Autor:
Cabello, Sergio, Czabarka, Éva, Fabila-Monroy, Ruy, Higashikawa, Yuya, Seidel, Raimund, Székely, László, Tkadlec, Josef, Wesolek, Alexandra
Let $S$ be a set of four points chosen independently, uniformly at random from a square. Join every pair of points of $S$ with a straight line segment. Color these edges red if they have positive slope and blue, otherwise. We show that the probabilit
Externí odkaz:
http://arxiv.org/abs/2312.01935
Let $G$ be a graph of order $n$ and let $k\in \{1,2,\ldots,n-1\}$. The $k$-token graph of $G$ is the graph, whose vertices are all the $k$-subsets of vertices of $G$, where two such $k$-sets are adjacent whenever their symmetric difference is an edge
Externí odkaz:
http://arxiv.org/abs/2302.07914
Autor:
Fabila-Monroy, Ruy
A \emph{geometric graph} is a graph whose vertex set is a set of points in general position in the plane, and its edges are straight line segments joining these points. We show that for every integer $k \ge 2$, there exists a constat $c>0$ such that
Externí odkaz:
http://arxiv.org/abs/2301.07261
Let $S$ be a set of $n$ points in general position in the plane. The Second Selection Lemma states that for any family of $\Theta(n^3)$ triangles spanned by $S$, there exists a point of the plane that lies in a constant fraction of them. For families
Externí odkaz:
http://arxiv.org/abs/2210.00630
A group of cooperative aerial robots can be deployed to efficiently patrol a terrain, in which each robot flies around an assigned area and shares information with the neighbors periodically in order to protect or supervise it. To ensure robustness,
Externí odkaz:
http://arxiv.org/abs/2209.06968