A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Erde, Joshua | - |
dc.contributor.author | J. Pascal Gollin | - |
dc.contributor.author | Joó, Atilla | - |
dc.contributor.author | Knappe, Paul | - |
dc.contributor.author | Pitz, Max | - |
dc.date.accessioned | 2021-08-05T01:30:03Z | - |
dc.date.accessioned | 2021-08-05T01:30:04Z | - |
dc.date.available | 2021-08-05T01:30:03Z | - |
dc.date.available | 2021-08-05T01:30:04Z | - |
dc.date.created | 2021-02-23 | - |
dc.date.issued | 2021-07 | - |
dc.identifier.issn | 0095-8956 | - |
dc.identifier.uri | https://pr.ibs.re.kr/handle/8788114/10027 | - |
dc.description.abstract | We show that if a graph admits a packing and a covering both consisting of ? many spanning trees, where ? is some infinite cardinal, then the graph also admits a decomposition into ? many spanning trees. For finite ? the analogous question remains open, however, a slightly weaker statement is proved. ? 2021 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/). | - |
dc.language | 영어 | - |
dc.publisher | ACADEMIC PRESS INC ELSEVIER SCIENCE | - |
dc.title | A Cantor-Bernstein-type theorem for spanning trees in infinite graphs | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.identifier.wosid | 000642463700002 | - |
dc.identifier.scopusid | 2-s2.0-85099628015 | - |
dc.identifier.rimsid | 74592 | - |
dc.contributor.affiliatedAuthor | J. Pascal Gollin | - |
dc.identifier.doi | 10.1016/j.jctb.2021.01.004 | - |
dc.identifier.bibliographicCitation | Journal of Combinatorial Theory. Series B, v.149, pp.16 - 22 | - |
dc.relation.isPartOf | Journal of Combinatorial Theory. Series B | - |
dc.citation.title | Journal of Combinatorial Theory. Series B | - |
dc.citation.volume | 149 | - |
dc.citation.startPage | 16 | - |
dc.citation.endPage | 22 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalWebOfScienceCategory | Mathematics | - |
dc.subject.keywordAuthor | Spanning trees | - |
dc.subject.keywordAuthor | Colouring number | - |
dc.subject.keywordAuthor | Packing | - |
dc.subject.keywordAuthor | Covering | - |