The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem

Leonardo Martínez-Sandoval, Arnau Padrol

Type: Preprint

Publication Date: 2019-01-01

Citations: 0

DOI: https://doi.org/10.48550/arxiv.1909.01189

View Publication

Locations

arXiv (Cornell University) - View - PDF
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem	2019	Leonardo Martínez-Sandoval Arnau Padrol
+ PDF Chat	The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem	2021	Leonardo Martínez-Sandoval Arnau Padrol
+	k-Sets and rectilinear crossings in complete uniform hypergraphs	2019	Rahul Gangopadhyay Saswata Shannigrahi
+	Extremal hypergraph problems and convex hulls	1985	Péter L. Erdős Gyula O. H. Katona Péter Frankl
+	Hypergraph Representation via Axis-Aligned Point-Subspace Cover	2021	Oksana Firman Joachim Spoerhase
+ PDF Chat	On the Zarankiewicz Problem for Intersection Hypergraphs	2015	Nabil H. Mustafa János Pach
+	High dimensional Hoffman bound and applications in extremal combinatorics	2019	Yuval Filmus Konstantin Golubev Noam Lifshitz
+ PDF Chat	High dimensional Hoffman bound and applications in extremal combinatorics	2022	Yuval Filmus Konstantin Golubev Noam Lifshitz
+	Bollobás-type inequalities on set $k$-tuples	2018	Jason O’Neill Jacques Verstraëte
+	Nonconvexity of the set of hypergraph degree sequences	2012	Ricky Ini Liu
+	Nonconvexity of the set of hypergraph degree sequences	2012	Ricky Ini Liu
+ PDF Chat	Hypergraph Representation via Axis-Aligned Point-Subspace Cover	2021	Oksana Firman Joachim Spoerhase
+ PDF Chat	Nonconvexity of the Set of Hypergraph Degree Sequences	2013	Ricky Ini Liu
+	Weak Coloring Numbers of Intersection Graphs.	2021	Zdeněk Dvořák Jakub Pekárek Torsten Ueckerdt Yelena Yuditsky
+	On the Zarankiewicz problem for intersection hypergraphs	2016	Nabil H. Mustafa János Pach
+ PDF Chat	The Minimum Number of Nonnegative Edges in Hypergraphs	2014	Hao Huang Benny Sudakov
+	Tight paths and matchings in convex geometric hypergraphs	2017	Zoltán F uredi Tao Jiang Alexandr Kostochka Dhruv Mubayi Jacques Verstraëte
+	A Ramsey-type result for geometric l-hypergraphs	2013	Dhruv Mubayi Andrew Suk
+	A Ramsey-type result for geometric l-hypergraphs	2013	Dhruv Mubayi Andrew Suk
+	Weak Coloring Numbers of Intersection Graphs	2021	Zdeněk Dvořák Jakub Pekárek Torsten Ueckerdt Yelena Yuditsky

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (27)

Action	Title	Year	Authors
+	Combinatorial Convexity and Algebraic Geometry	1996	Günter Ewald
+ PDF Chat	A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets	2010	Ondřej Bílka Kevin Buchin Radoslav Fulek Masashi Kiyomi Yoshio Okamoto Shin‐ichi Tanigawa Csaba D. Tóth
+ PDF Chat	Maximal f-Vectors of Minkowski Sums of Large Numbers of Polytopes	2011	Christophe Weibel
+	Total positivity, Grassmannians, and networks	2006	Alexander Postnikov
+ PDF Chat	Convex Matroid Optimization	2003	Shmuel Onn
+	Normal Polytopes Arising from Finite Graphs	1998	Hidefumi Ohsugi Takayuki Hibi
+ PDF Chat	The degree of point configurations: Ehrhart theory, Tverberg points and almost neighborly polytopes	2015	Benjamin Nill Arnau Padrol
+ PDF Chat	Prodsimplicial-Neighborly Polytopes	2010	Benjamin Matschke Julián Pfeifle Vincent Pilaud
+	On the largest convex subsets in Minkowski sums	2014	Hans Raj Tiwary
+ PDF Chat	Weak separation and plabic graphs	2015	Suho Oh Alexander Postnikov David E Speyer