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 2021 · math.COShow all

2 papers · 2 filters

math.CO2021

Edge connectivity of simplicial polytopes

Guillermo Pineda-Villavicencio, Julien Ugon

A simplicial polytope is a polytope with all its facets being combinatorially equivalent to simplices. We deal with the edge connectivity of the graphs of simplicial polytopes. We…

math.CO2021

A lower bound theorem for $d$ -polytopes with $2 d + 1$ vertices

Guillermo Pineda-Villavicencio, David Yost

The problem of calculating exact lower bounds for the number of $k$ -faces of $d$ -polytopes with $n$ vertices, for each value of $k$ , and characterising the minimisers, has recently…

Edge connectivity of simplicial polytopes

A lower bound theorem for d-polytopes with 2d+1 vertices

A lower bound theorem for $d$ -polytopes with $2 d + 1$ vertices