Guillermo Pineda-Villavicencio

activity

20102026

most citedLower bound theorems for general polytopes

14 citations · 46 across the 26 of their papers we have counts for

collaborators

Showing 2013 · math.COShow all

3 papers · 2 filters

math.CO2013★ 2 cited

On the maximum order of graphs embedded in surfaces

Eran Nevo, Guillermo Pineda-Villavicencio, David R. Wood

The maximum number of vertices in a graph of maximum degree $Δ \geq 3$ and fixed diameter $k \geq 2$ is upper bounded by $(1 + o (1)) (Δ - 1)^{k}$ . If we restrict our graphs to certain class…

math.CO2013

The degree-diameter problem for sparse graph classes

Guillermo Pineda-Villavicencio, David R. Wood

The degree-diameter problem asks for the maximum number of vertices in a graph with maximum degree $Δ$ and diameter $k$ . For fixed $k$ , the answer is $Θ (Δ^{k})$ . We consider the degr…

math.CO2013★ 1 cited

Constructions of Large Graphs on Surfaces

Ramiro Feria-Puron, Guillermo Pineda-Villavicencio

We consider the degree/diameter problem for graphs embedded in a surface, namely, given a surface $Σ$ and integers $Δ$ and $k$ , determine the maximum order $N (Δ, k, Σ)$ of a graph em…