Győri, Ervin and Mezei, Tamás Róbert and Mészáros, G. (2018) Terminal-pairability in complete graphs. JOURNAL OF COMBINATORIAL MATHEMATICS AND COMBINATORIAL COMPUTING, 107. pp. 221-231. ISSN 0835-3026
|
Text
1605.05857v2.pdf Download (184kB) | Preview |
Official URL: https://arxiv.org/pdf/1605.05857
Abstract
We investigate terminal-pairability properties of complete graphs and improve the known bounds in two open problems. We prove that the complete graph Kn on n vertices is terminal-pairable if the maximum degree A of the corresponding demand multigraph D is at most 2[?J-4. We also verify the terminal-pairability property when the number of edges in D does not exceed In-5 and A < n-1 holds. © Charles Babbage Research Centre. All rights reserved.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Mathematical techniques; Graph theory; Complete graphs; Maximum degree; Combinatorial mathematics; Multigraphs; |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 12 Jan 2019 15:06 |
| Last Modified: | 12 Jan 2019 15:06 |
| URI: | http://real.mtak.hu/id/eprint/89783 |
Actions (login required)
 |
Edit Item |
