Access the full text.
Sign up today, get DeepDyve free for 14 days.
B. Grünbaum (1970)
Higher-Dimensional analogs of the four-color problem and some inequalities for simplicial complexesJournal of Combinatorial Theory, Series A, 8
Katuhiko Mizuno (1954)
On the minimal complexesJournal of the Institute of Polytechnics, Osaka City University. Series A: Mathematics, 5
J. Matouvsek, M. Tancer, Uli Wagner (2008)
Hardness of embedding simplicial complexes in $\mathbb {R}^d$Journal of the European Mathematical Society, 013
Frank Lutz, T. Sulanke, Ed Swartz (2008)
f-Vectors of 3-ManifoldsElectron. J. Comb., 16
E. Kampen (1933)
Komplexe in euklidischen RäumenAbhandlungen aus dem Mathematischen Seminar der Universität Hamburg, 9
C. Greene, D. Kleitman (1978)
Proof techniques in the theory of finite sets
F. Hurtado, M. Kreveld (2011)
Proceedings of the twenty-seventh annual symposium on Computational geometry
H. Whitney (1931)
Non-Separable and Planar Graphs.Proceedings of the National Academy of Sciences of the United States of America, 17 2
W. Tutte (1970)
Toward a theory of crossing numbersJournal of Combinatorial Theory, Series A, 8
G. Ziegler (1994)
Lectures on Polytopes
U. Brehm (1983)
A nonpolyhedral triangulated Möbius strip, 89
(1984)
Menlo Park
Uli Wagner (2011)
Minors in random and expanding hypergraphs
J. Matoušek, M. Tancer, Uli Wagner (2009)
Hardness of embedding simplicial complexes in Rd
A. Björner, G. Kalai (1988)
An extended Euler-Poincaré theoremActa Mathematica, 161
T. Dey, H. Edelsbrunner (1993)
Counting triangle crossings and halving planesDiscrete & Computational Geometry, 12
Edward Kenschaft (2008)
Master's Thesis
S. Lane (1937)
A structural characterization of planar combinatorial graphsDuke Mathematical Journal, 3
Frank Zeeuw (2016)
Graph Theory
J. Munkres (1984)
Elements of algebraic topology
R. Thom (2004)
RENÉ THOM’S WORK ON GEOMETRIC HOMOLOGY AND BORDISM
J. Cannon (1979)
Shrinking cell-like decompositions of manifolds. Codimension threeAnnals of Mathematics, 110
(2008)
Extermal combinatorics ii: Some geometry and number theory
J. Matoušek (2003)
Using The Borsuk-Ulam Theorem
(1963)
Sudies AM-51
T. Dey, J. Pach (1996)
Extremal Problems for Geometric HypergraphsDiscrete & Computational Geometry, 19
S. Parsa (2017)
On the Links of Vertices in Simplicial d-Complexes Embeddable in the Euclidean 2d-SpaceDiscrete & Computational Geometry, 59
A. Shapiro (1957)
Obstructions to the Imbedding of a Complex in a Euclidean Space.: I. The First ObstructionAnnals of Mathematics, 66
[We study d-dimensional simplicial complexes that are PL embeddable in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\mathbb{R}^{d+1}$$ \end{document}. It is shown that such a complex must satisfy a certain homological condition. The existence of this obstruction allows us to provide a systematic approach to deriving upper bounds for the number of top-dimensional faces of such complexes, particularly in low dimensions.]
Published: May 10, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.