• Corpus ID: 244116932

# Edge connectivity of simplicial polytopes

@inproceedings{PinedaVillavicencio2021EdgeCO,
title={Edge connectivity of simplicial polytopes},
author={Guillermo Pineda-Villavicencio and Julien Ugon},
year={2021}
}
• Published 13 November 2021
• Mathematics
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 first establish that, for any $d\ge 3$, for any $d\ge 3$, every minimum edge cut of cardinality at most $4d-7$ in such a graph is \textit{trivial}, namely it consists of all the edges incident with some vertex. A consequence of this is that, for $d\ge 3$, the graph of a simplicial $d$-polytope with minimum degree…

## Figures from this paper

Mathematics
• 2018
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least
Mathematics
J. Comb. Theory, Ser. A
• 2020
Mathematics
The Electronic Journal of Combinatorics
• 2021
The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is $k$-linked if, for every set of $k$ disjoint pairs of vertices, there are $k$
1* Definitions and preliminary results* If v is a vertex of a d-polytope P then the antistar of v in P, denoted ast(v, P), is the set of all ά-faces of P that miss v, 0 <Ξ k ̂ d — 1. If H is a
Ad-polytope is ad-dimensional set that is the convex hull of a finite number of points. Ad-polytope is simple provided each vertex meets exactlyd edges. It has been conjectured that for simple
In this paper we give a proof of the long-standing Upper-bound Conjecture for convex polytopes, which states that, for 1 ≤ j d v , the maximum possible number of j -faces of a d -polytope with v
Based on a graduate course given at the Technische Universitat, Berlin, these lectures present a wealth of material on the modern theory of convex polytopes. The clear and straightforward
The objects and the tools.- The universality theorem.- Applications of university.- Three-dimensional polytopes.- Alternative construction techniques.- Problems.