Abstract
We find the minimal number of non-trivial links in an embedding of any complete $k$-partite graph on 7 vertices (including $K_{7}$, which has at least 21 non-trivial links). We give either exact values or upper and lower bounds for the minimal number of non-trivial links for all complete $k$-partite graphs on 8 vertices. We also look at larger complete bipartite graphs, and state a conjecture relating minimal linking embeddings with minimal book embeddings.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
