<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:DOC-256NYGJ7</identifier><date>2015</date><creator>Borndörfer, Ralf</creator><creator>Heismann, Olga</creator><relation>documents/doc/2/URN_NBN_SI_doc-256NYGJ7_001.pdf</relation><relation>documents/doc/2/URN_NBN_SI_doc-256NYGJ7_001.txt</relation><format format_type="issue">3</format><format format_type="volume">39</format><format format_type="type">article</format><format format_type="extent">str. 229-235</format><identifier identifier_type="ISSN">0350-5596</identifier><identifier identifier_type="COBISSID">29596967</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-256NYGJ7</identifier><language>eng</language><publisher>Slovensko društvo Informatika</publisher><source>Informatica (Ljubljana)</source><rights>InC</rights><subject language_type_id="slv">dvojno povezani grafi</subject><subject language_type_id="slv">matematika</subject><subject language_type_id="eng">mathematics</subject><subject language_type_id="slv">Parisijev izrek</subject><subject language_type_id="slv">teorija grafov</subject><title>The random hypergraph assignment problem</title></Record>