<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>1447</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2012-01-18</completedDate>
    <publishedDate>2012-01-18</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Note on Menger's Theorem for Hypergraphs</title>
    <abstract language="eng">We prove the companion Theorem to Menger's Theorem for&#13;
  hypergraphs. This result gives rise to a new class of blocking pairs&#13;
  of ideal matrices, that generalize the incidence matrices of cuts&#13;
  and paths.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="serial">12-03</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-14471</identifier>
    <author>Ralf Borndörfer</author>
    <submitter>Marika Karbstein</submitter>
    <author>Marika Karbstein</author>
    <series>
      <title>ZIB-Report</title>
      <number>12-03</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>ideal matrices</value>
    </subject>
    <collection role="msc" number="90C10">Integer programming</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="traffic">Mathematics of Transportation and Logistics</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1447/ZR-12-03.pdf</file>
  </doc>
</export-example>
