Weakly linked embeddings of pairs of complete graphs in R^3
From MaRDI portal
Publication:2138585
DOI10.37236/10322zbMATH Open1494.57038arXiv2012.11030OpenAlexW3113988842MaRDI QIDQ2138585FDOQ2138585
Authors: Yanyan Li
Publication date: 12 May 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Abstract: Let and be disjoint embeddings of complete graphs and in such that some cycle in links a cycle in with non-zero linking number. We say that and are *weakly linked* if the absolute value of the linking number of any cycle in with a cycle in is or . Our main result is an algebraic characterisation of when a pair of disjointly embedded complete graphs is weakly linked. As a step towards this result, we show that if and are weakly linked, then each contains either a vertex common to all triangles linking the other or a triangle which shares an edge with all triangles linking the other. All families of weakly linked pairs of complete graphs are then characterised by which of these two cases holds in each complete graph.
Full work available at URL: https://arxiv.org/abs/2012.11030
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cites Work
- Knots and links in spatial graphs
- Linear embeddings of \(K_{9}\) are triple linked
- Intrinsic knotting and linking of complete graphs
- Sachs' linkless embedding conjecture
- Counting links in complete graphs
- Intrinsically triple linked complete graphs
- Intrinsically \(n\)-linked complete graphs
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Weakly linked embeddings of pairs of complete graphs in \(\mathbb{R}^3\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2138585)