English
Related papers

Related papers: An intrinsically linked simplicial $n$-complex

200 papers

We study the Linial--Meshulam model of random two-dimensional simplicial complexes. One of our main results states that for $p\ll n^{-1}$ a random 2-complex $Y$ collapses simplicially to a graph and, in particular, the fundamental group…

Algebraic Topology · Mathematics 2010-06-29 Armindo Costa , Michael Farber , Thomas Kappeler

We say that a graph is intrinsically non-trivial if every spatial embedding of the graph contains a non-trivial spatial subgraph. We prove that an intrinsically non-trivial graph is intrinsically linked, namely every spatial embedding of…

Geometric Topology · Mathematics 2016-01-20 Ryo Nikkuni

For positive integers k,n, we investigate the simplicial complex NM_k(n) of all graphs G on vertex set [n] such that every matching in G has size less than k. This complex (along with other associated cell complexes) is found to be homotopy…

Combinatorics · Mathematics 2007-05-23 Svante Linusson , John Shareshian , Volkmar Welker

Let $n$, $q$ and $r$ be positive integers, and let $K_N^n$ be the $n$-skeleton of an $(N-1)$-simplex. We show that for $N$ sufficiently large every embedding of $K_N^n$ in $\mathbb{R}^{2n+1}$ contains a link $L_1\cup\cdots\cup L_r$…

Geometric Topology · Mathematics 2019-01-21 Christopher Tuffley

The current article considers Mayer cluster integrals of n-dimensional hard particles in the n>1 dimensional flat Euclidean space. Extending results from Wertheim and Rosenfeld, we proof that the graphs are completely reducible into 1- and…

Mathematical Physics · Physics 2011-05-19 Stephan Korden

It is shown that Euler's theorem for graphs can be generalized for 2-complexes. Two notions that generalize cycle and Eulerian tour are introduced (``circlet'' and ``Eulerian cover''), and we show that for a strongly-connected, pure…

Combinatorics · Mathematics 2024-01-02 Richard H. Hammack , Paul C. Kainen

We consider closed simplicial and cubical $n$-complexes in terms of link of their $(n-2)$-faces. Especially, we consider the case, when this link has size 3 or 4, i.e., every $(n-2)$-face is contained in 3 or 4 $n$-faces. Such simplicial…

Geometric Topology · Mathematics 2007-05-23 Michel Deza , Mathieu Dutour , Mikhail Shtogrin

We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpler one. We give some applications of this method to complexes arising from graphs. As a consequence, we answer some questions raised in…

Combinatorics · Mathematics 2007-05-23 Mario Marietti , Damiano Testa

For each positive integer n, Khovanov and Rozansky constructed an invariant of links in the form of a doubly-graded cohomology theory whose Euler characteristic is the sl(n) link polynomial. We use Lagrangian Floer cohomology on some…

Symplectic Geometry · Mathematics 2007-05-23 Ciprian Manolescu

Complexes of (not) connected graphs, hypergraphs and their homology appear in the construction of knot invariants given by V. Vassiliev. In this paper we study the complexes of not $i$-connected $k$-hypergraphs on $n$ vertices. We show that…

Combinatorics · Mathematics 2016-09-07 Eric Babson , Anders Björner , Svante Linusson , John Shareshian , Volkmar Welker

We produce an infinite family of $2$-complexes that are intrinsically linked when embedded into four dimensions. In particular, we show that any embedding into $\mathbb{R}^4$ of the suspension of a graph containing $K_6$ as a minor contains…

Geometric Topology · Mathematics 2026-05-11 Nathan Huber , Ishaan Raghavendra Rao , Hannah Schwartz Joseph , Tanishga Thankaraj Vijay

We prove the existence of a ternary sequence of factor complexity $2n+1$ for any given vector of rationally independent letter frequencies. Such sequences are constructed from an infinite product of two substitutions according to a…

Combinatorics · Mathematics 2021-02-25 Julien Cassaigne , Sébastien Labbé , Julien Leroy

We derive an integral formula for the linking number of two submanifolds of the n-sphere S^n, of the product S^n x R^m, and of other manifolds which appear as "nice" hypersurfaces in Euclidean space. The formulas are geometrically…

Geometric Topology · Mathematics 2011-10-07 Clayton Shonkwiler , David Shea Vela-Vick

We prove a topological extension of Dirac's theorem suggested by Gowers in 2005: for any connected, closed surface $\mathscr{S}$, we show that any two-dimensional simplicial complex on $n$ vertices in which each pair of vertices belongs to…

Combinatorics · Mathematics 2022-06-14 Agelos Georgakopoulos , John Haslegrave , Richard Montgomery , Bhargav Narayanan

We extend the edge version of the classical Menger's Theorem for undirected graphs to $n$-dimensional simplicial complexes with chains over the field $\mathbb{F}_2$. The classical Menger's Theorem states that two different vertices in an…

Geometric Topology · Mathematics 2021-11-19 Avraham Goldstein , Yonah Cherniavsky

We prove that every embedding of $K_{2n+1,2n+1}$ into $\R^3$ contains a non-split link of $n$-components. Further, given an embedding of $K_{2n+1,2n+1}$ in $\R^3$, every edge of $K_{2n+1,2n+1}$ is contained in a non-split $n$-component link…

Geometric Topology · Mathematics 2007-05-23 Danielle O'Donnol

In this paper we present short algebraic proofs of the Linear Conway--Gordon--Sachs and the Linear van Kampen--Flores theorems in the spirit of the Radon theorem on convex hulls. {\bf Theorem.} {\it Take any $n+3$ general position points in…

Combinatorics · Mathematics 2015-08-14 Ilya I. Bogdanov , Alexander D. Matushkin

Let $G=(V,E)$ be a graph and $n$ a positive integer. Let $I_n(G)$ be the abstract simplicial complex whose simplices are the subsets of $V$ that do not contain an independent set of size $n$ in $G$. We study the collapsibility numbers of…

Combinatorics · Mathematics 2024-10-15 Minki Kim , Alan Lew

Many of the strengthenings and extensions of the topological Tverberg theorem can be derived with surprising ease directly from the original theorem: For this we introduce a proof technique that combines a concept of "Tverberg unavoidable…

Combinatorics · Mathematics 2017-12-12 Pavle V. M. Blagojević , Florian Frick , Günter M. Ziegler

Motivated by potential applications in network theory, engineering and computer science, we study $r$-ample simplicial complexes. These complexes can be viewed as finite approximations to the Rado complex which has a remarkable property of…

Algebraic Topology · Mathematics 2023-09-14 Chaim Even-Zohar , Michael Farber , Lewis Mead