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 Edit this on Wikidata


Publication date: 12 May 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: Let G and H be disjoint embeddings of complete graphs Km and Kn in mathbbR3 such that some cycle in G links a cycle in H with non-zero linking number. We say that G and H are *weakly linked* if the absolute value of the linking number of any cycle in G with a cycle in H is 0 or 1. 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 G and H 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


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)