The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem
L Martínez-Sandoval, A Padrol - Journal of Combinatorial Theory, Series B, 2021 - Elsevier
The convex dimension of a k-uniform hypergraph is the smallest dimension d for which there
is an injective map** of its vertices into R d such that the set of k-barycenters of all …
is an injective map** of its vertices into R d such that the set of k-barycenters of all …
[HTML][HTML] Drawing graphs with vertices and edges in convex position
A graph has strong convex dimension 2 if it admits a straight-line drawing in the plane such
that its vertices form a convex set and the midpoints of its edges also constitute a convex set …
that its vertices form a convex set and the midpoints of its edges also constitute a convex set …
Convexly independent subsets of Minkowski sums of convex polygons
Convexly independent subsets of Minkowski sums of convex polygons - ScienceDirect Skip to
main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …
main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …