activity
20122026
most citedA note on the tolerated Tverberg theorem

2 citations · 8 across the 8 of their papers we have counts for

collaborators

10 papers

math.CO2026

Disconnected graphs and extremal bounds for realizable distance orders

Gerardo L. Maldonado, Leonardo Martínez-Sandoval, Miguel Raggi +1

Let be a graph together with a total order on its edges. We say that is realizable in if there is a placement of the vertices of in $\mathbb{…

math.MG2025

A four-dimensional body of constant width

Marcela G. Mercado-Flores, Miguel Raggi, Edgardo Roldán-Pensado

The study of bodies of constant width is a classical subject in convex geometry, with the 3-dimensional Meissner bodies being canonical examples. This paper presents a novel geomet…

math.CO2023

Total orders realizable as the distances between two sets of points

Gerardo L. Maldonado, Miguel Raggi Pérez, Edgardo Roldán-Pensado

In this note we give a negative answer to a question proposed by Almendra-Hernández and Martínez-Sandoval. Let be positive integers and let and be sets of sizes $n…

cs.CG2019

The graphs behind Reuleaux polyhedra

Luis Montejano, Eric Pauli, Miguel Raggi +1

This work is about graphs arising from Reuleaux polyhedra. Such graphs must necessarily be planar, -connected and strongly self-dual. We study the question of when these conditi…

cs.DM2016★ 1 cited

Finding long simple paths in a weighted digraph using pseudo-topological orderings

Miguel Raggi

Given a weighted digraph D, finding the longest simple path is well known to be NP-hard. Furthermore, even giving an approximation algorithm is known to be NP-hard. In this paper w…

math.CO2016★ 2 cited

A note on the tolerated Tverberg theorem

Natalia García-Colín, Miguel Raggi, Edgardo Roldán-Pensado

In this paper we give an asymptotically tight bound for the tolerated Tverberg Theorem when the dimension and the size of the partition are fixed. To achieve this we study certain…