- Title
- Linkedness of cartesian products of complete graphs
- Creator
- Jorgensen, Leif; Pineda-Villavicencio, Guillermo; Ugon, Julien
- Date
- 2022
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/189537
- Identifier
- vital:17450
- Identifier
-
https://doi.org/10.26493/1855-3974.2577.25d
- Identifier
- ISSN:1855-3966 (ISSN)
- Abstract
- This paper is concerned with the linkedness of Cartesian products of complete graphs. A graph with at least 2k vertices is k-linked if, for every set of 2k distinct vertices organised in arbitrary k pairs of vertices, there are k vertex-disjoint paths joining the vertices in the pairs. We show that the Cartesian product Kd1+1 × Kd2+1 of complete graphs Kd1+1 and Kd2+1 is
- Publisher
- Society of Mathematicians, Physicists and Astronomers of Slovenia
- Relation
- Ars Mathematica Contemporanea Vol. 22, no. 2 (2022), p.; http://purl.org/au-research/grants/arc/DP180100602
- Rights
- All metadata describing materials held in, or linked to, the repository is freely available under a CC0 licence
- Rights
- https://creativecommons.org/licenses/by/4.0/
- Rights
- Copyright © 2022 Society of Mathematicians, Physicists and Astronomers of Slovenia.
- Rights
- Open Access
- Subject
- 4901 Applied mathematics; 4904 Pure mathematics; Cartesian product; Connectivity; Cyclic polytope; Dual polytope; K-linked; Linkedness
- Full Text
- Reviewed
- Funder
- Julien Ugon’s research was supported by the ARC discovery project DP180100602.
- Hits: 363
- Visitors: 403
- Downloads: 46
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | SOURCE1 | Published version | 583 KB | Adobe Acrobat PDF | View Details Download |