Optimal connectivity for fat-triangle linkages

Department

Mathematics

Document Type

Article

Publication Date

5-1-2023

Abstract

For a multigraph H, a graph G is H-linked if every injective mapping ϕ:V(H)→V(G) can be extended to an H-subdivision in G. We study the minimum connectivity required for a graph to be H-linked. A k-fat-triangle Fk is a multigraph with three vertices and a total of k edges. We determine a sharp connectivity requirement for a graph to be Fk-linked. In particular, any k-connected graph is Fk-linked when Fk is connected.

Journal Title

Discrete Mathematics

Journal ISSN

0012365X

Volume

346

Issue

5

Digital Object Identifier (DOI)

10.1016/j.disc.2023.113319

Share

COinS