Menger's Theorem as Morphism Duality

Hochstättler, Winfried and Nesetril, Jaroslav (1997) Menger's Theorem as Morphism Duality.
Technical Report , 5 p.

Abstract

The purpose of this note is to point out that Menger's Theorem in a quite natural way gives an example of a morphism duality. In this setting it is the simple equation (C_k,e) --> = -/-> (C_{k+1},e).


Actions:
Download: [img] Postscript
Download (143kB) | Preview
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Paper (Technical Report)
Citations: No citation data.
Uncontrolled Keywords: duality homomorphism matroids Menger's theorem strong map
Subjects:
  • 05-XX Combinatorics > 05Bxx Designs and configurations > 05B35 Matroids, geometric lattices

  • 05-XX Combinatorics > 05Bxx Designs and configurations > 05B40 Packing and covering

  • 05-XX Combinatorics > 05Cxx Graph theory > 05C38 Paths and cycles

  • 18-XX Category theory; abstract homological algebra > 18Bxx Special categories > 18B99 None of the above, but in this section

  • 90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C27 Combinatorial optimization

  • 05-XX Combinatorics > 05Cxx Graph theory > 05C70 Factorization, matching, covering and packing

    		•
    Divisions: Mathematical Institute
    Related URLs:
    Deposit Information:
    ZAIK Number: zpr97-286
    Depositing User: Winfried Hochstättler
    Date Deposited: 02 Apr 2001 00:00
    Last Modified: 19 Dec 2011 09:44
    URI: http://e-archive.informatik.uni-koeln.de/id/eprint/286