Counting Links in Complete Graphs

Simple item page
dc.creatorFleming, Tom
dc.creatorMellor, Blake
dc.date2006-11-21
dc.date.accessioned2026-07-07T12:27:43Z
dc.date.available2026-07-07T12:27:43Z
dc.descriptionWe find the minimal number of links in an embedding of any complete $k$-partite graph on 7 vertices (including $K_7$, which has at least 21 links). We give either exact values or upper and lower bounds for the minimal number of 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.
dc.description21 pages, several figures
dc.identifierhttps://arxiv.org/abs/math/0611626
dc.identifierhttp://arxiv.org/abs/math/0611626
dc.identifierOsaka J. Math., vol. 46, 2009, pp. 1-29
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/215303
dc.subjectCombinatorics
dc.subjectGeometric Topology
dc.subject05C10; 57M15
dc.titleCounting Links in Complete Graphs
dc.typetext

Files

Collections

arXiv