Show simple item record

Topological cycle matroids of infinite graphs

dc.creatorCarmesin, Johannes
dc.date.accessioned2016-09-20
dc.date.accessioned2018-11-24T23:27:20Z
dc.date.available2017-06-02T11:11:12Z
dc.date.available2018-11-24T23:27:20Z
dc.date.issued2017-02-01
dc.identifierhttps://www.repository.cam.ac.uk/handle/1810/264606
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/123456789/3962
dc.description.abstractWe prove that the topological cycles of an arbitrary infinite graph together with its topological ends form a matroid. This matroid is, in general, neither finitary nor cofinitary.
dc.languageen
dc.publisherElsevier
dc.publisherEuropean Journal of Combinatorics
dc.rightshttp://creativecommons.org/licenses/by-nc-nd/4.0/
dc.rightshttp://creativecommons.org/licenses/by-nc-nd/4.0/
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International
dc.titleTopological cycle matroids of infinite graphs
dc.typeArticle


Files in this item

FilesSizeFormatView
Carmesin-2017-E ... al_of_Combinatorics-AM.pdf367.0Kbapplication/pdfView/Open

This item appears in the following Collection(s)

Show simple item record