Linearly free graphs

DOI10.1002/JGT.22783MaRDI QIDQ6057892zbMATH OpenOpenAlexFDO

Authors Youngsik Huh, Jung Hoon Lee

Publication date 5 October 2023

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2206.11449

zbMATH Keywords

\(3\)-spacefree groupfundamental grouplinearly free graphspatial graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Knot theory (57K10) Relations of low-dimensional topology with graph theory (57M15)

Abstract: 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 be a line segment. And we say that an embedding $f$ of a graph $G$ into $mathbb{R}^3$ is free, if $p{i}_1(mathbb{R}^3-f(G))$ is a free group. Lastly a simple connected graph is said to be linearly free if every its linear embedding is free. In 1980s it was proved that every complete graph is linearly free, by Nicholson. In this paper, we develop Nicholson's arguments into a general notion, and establish a sufficient condition for a linear embedding to be free. As an application of the condition we give a partial answer for a question: how much can the complete graph $K_n$ be enlarged so that the linear freeness is preserved and the clique number does not increase? And an example supporting our answer is provided. As the second application it is shown that a simple connected graph of minimal valency at least $3$ is linearly free, if it has less than 8 vertices. The conditional inequality is strict, because we found a graph with $8$ vertices which is not linearly free. It is also proved that for $n,mleq6$ the complete bipartite graph $K_{n,m}$ is linearly free.

Recommendations

• Linearly embedded graphs in 3-space with homotopically free exteriors
• Ramsey Theorems for Knots, Links and Spatial Graphs
• The system of abstract connected subgraphs of a linear graph
• All trees are 1-embeddable and all except stars are 2-embeddable
• Topological Ramsey theorem for complete bipartite graphs
• scientific article; zbMATH DE number 7007304
• Graph labellings in Boolean lattices
• Asteroidal triple-free graphs
• On k-critical connected line graphs
• On the structure of linear graphs

Cites work

• An algorithm for detecting intrinsically knotted graphs
• Bipartite intrinsically knotted graphs with 22 edges
• Color Invariant for Spatial Graphs
• Detecting unknotted graphs in 3-space
• Exactly fourteen intrinsically knotted graphs have 21 edges
• scientific article; zbMATH DE number 4107746 (Why is no real title available?)
• scientific article; zbMATH DE number 3574107 (Why is no real title available?)
• Intrinsic linking and knotting are arbitrarily complex
• Intrinsically knotted graphs
• Knots and links in spatial graphs
• Linearly embedded graphs in 3-space with homotopically free exteriors
• Many, many more intrinsically knotted graphs
• More intrinsically knotted graphs
• On intrinsically knotted or completely 3-linked graphs
• On planarity of graphs in 3-manifolds
• On primitive sets of loops in the boundary of a handlebody
• Sachs' linkless embedding conjecture
• When graph theory meets knot theory

This page was built for publication: Linearly free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6057892)