Related papers: Linear embeddings of $K_9$ are triple linked
We show that there are exactly eight MMIK (minor minimal intrinsically knotted) graphs of order nine.
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…
We describe the structure of 2-connected non-planar toroidal graphs with no K_{3,3}-subdivisions, using an appropriate substitution of planar networks into the edges of certain graphs called toroidal cores. The structural result is based on…
We show that for every m in N, there exists an n in N such that every embedding of the complete graph K_n in R^3 contains a link of two components whose linking number is at least m. Furthermore, there exists an r in N such that every…
We consider intrinsic linking and knotting in the context of directed graphs. We construct an example of a directed graph that contains a consistently oriented knotted cycle in every embedding. We also construct examples of intrinsically…
In this paper we are interested in an intrinsic property of graphs which is derived from their embeddings into the Euclidean 3-space $\mathbb{R}^3$. An embedding of a graph into $\mathbb{R}^3$ is said to be linear, if it sends every edge to…
Given an undirected graph, are there $k$ matchings whose union covers all of its nodes, that is, a matching-$k$-cover? A first, easy polynomial solution from matroid union is possible, as already observed by Wang, Song and Yuan…
We investigate $k$-nets with $k\geq 4$ embedded in the projective plane $PG(2,\mathbb{K})$ defined over a field $\mathbb{K}$; they are line configurations in $PG(2,\mathbb{K})$ consisting of $k$ pairwise disjoint line-sets, called…
A graph on at least ${{k+1}}$ vertices is uniformly $k$-connected if each pair of its vertices is connected by $k$ and not more than $k$ independent paths. We reinvestigate a recent constructive characterization of uniformly $3$-connected…
We show that the minimum number of sticks required to construct a non-paneled knotless embedding of $K_4$ is 9 and of $K_5$ is 12 or 13. We use our results about $K_4$ to show that the probability that a random linear embedding of $K_{3,3}$…
In contrast with knots, whose properties depend only on their extrinsic topology in $S^3$, there is a rich interplay between the intrinsic structure of a graph and the extrinsic topology of all embeddings of the graph in $S^3$ . For…
A book representation of a graph is a particular way of embedding a graph in three dimensional space so that the vertices lie on a circle and the edges are chords on disjoint topological disks. We describe a set of operations on book…
In 1983 Conway and Gordon proved that any embedding of the complete graph $K_7$ into $\mathbb{R}^3$ contains at least one nontrivial knot as its Hamiltonian cycle. After their work knots (also links) are considered as intrinsic properties…
We introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at least 5n-14 edges is intrinsically knotted. We also classify…
We prove that the non-regular binary matroids with no $P_9^*$-minor have linear growth rate and the maximum size binary matroids with no $P_9^*$-minor are graphic. The main technique in the proof is the Strong Splitter Theorem using which…
We show that, given any $n$ and $\alpha$, every embedding of any sufficiently large complete graph in $\mathbb{R}^3$ contains an oriented link with components $Q_1$, ..., $Q_n$ such that for every $i\not =j$, $|\lk(Q_i,Q_j)|\geq\alpha$ and…
We show that for any simple non-oriented graph G with at least thirteen vertices either G or its complement is intrinsically linked.
A biased graph is a graph with a class of selected circles ("cycles", "circuits"), called "balanced", such that no theta subgraph contains exactly two balanced circles. A biased graph has two natural matroids, the frame matroid and the lift…
We describe an algorithm that recognizes some (perhaps all) intrinsically knotted (IK) graphs, and can help find knotless embeddings for graphs that are not IK. The algorithm, implemented as a Mathematica program, has already been used by…
Scheinerman and Wilf (1994) assert that `an important open problem in the study of graph embeddings is to determine the rectilinear crossing number of the complete graph K_n.' A rectilinear drawing of K_n is an arrangement of n vertices in…