Matroid intersection, base packing and base covering for infinite matroids

Link:
Autor/in:
Erscheinungsjahr:
2015
Medientyp:
Text
Schlagworte:
  • Infinite
  • Matroid
  • Infinite graphs
  • Graph In Graph Theory
  • Coloring
  • Graphic Methods
  • Infinite
  • Matroid
  • Infinite graphs
  • Graph In Graph Theory
  • Coloring
  • Graphic Methods
Beschreibung:
  • As part of the recent developments in infinite matroid theory, there have been a number of conjectures about how standard theorems of finite matroid theory might extend to the infinite setting. These include base packing, base covering, and matroid intersection and union. We show that several of these conjectures are equivalent, so that each gives a perspective on the same central problem of infinite matroid theory. For finite matroids, these equivalences give new and simpler proofs for the finite theorems corresponding to these conjectures. This new point of view also allows us to extend, and simplify the proofs of some cases where these conjectures were known to be true.
Lizenz:
  • info:eu-repo/semantics/restrictedAccess
Quellsystem:
Forschungsinformationssystem der UHH

Interne Metadaten
Quelldatensatz
oai:www.edit.fis.uni-hamburg.de:publications/5d6ba3f8-7b34-4321-9e82-5d5b0ef48a79