activity
20152026
most citedA sunflower anti-Ramsey theorem and its applications

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

collaborators

7 papers

math.CO2026

Pushed colorful polytopal KKMS Theorem and orthogonal star transversals

Leonardo Martínez-Sandoval, Ariadna Olvera-Sampieri

A classical theorem of Kaiser and Rabinovich implies that if every subfamily of size at most of a finite family of compact connected sets in $\mathbb{…

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.CO2021

On prescribing total preorders and linear orders to pairwise distances of points in Euclidean space

Víctor Hugo Almendra-Hernández, Leonardo Martínez-Sandoval

We show that any total preorder on a set with elements coincides with the order on pairwise distances of some point collection of size in . For…

cs.CG2020

Geometric Systems of Unbiased Representatives

Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore +1

Let be a set of points in , a bicoloring of and $\Oo$ a family of geometric objects (that is, intervals, boxes, balls, etc). An object from $\Oo$ is calle…

math.CO2019

Triangle areas in line arrangements

Gábor Damásdi, Leonardo Martínez-Sandoval, Dániel T. Nagy +1

A widely investigated subject in combinatorial geometry, originated from Erdős, is the following. Given a point set of cardinality in the plane, how can we describe the dis…

math.CO2016★ 1 cited

Depth with respect to a family of convex sets

Leonardo Martínez-Sandoval, Roee Tamam

We propose a notion of depth with respect to a finite family of convex sets in which we call . We begin showing that $\text{dep…

math.CO2015★ 1 cited

A sunflower anti-Ramsey theorem and its applications

Leonardo Martínez-Sandoval, Miguel Raggi, Edgardo Roldán-Pensado

A -sunflower in a hypergraph is a family of edges with vertices in common. We show that if we colour the edges of a complete hypergraph in such a way that any monochromatic…