{"?xml":{"@version":"1.0"},"edm:RDF":{"@xmlns:dc":"http://purl.org/dc/elements/1.1/","@xmlns:edm":"http://www.europeana.eu/schemas/edm/","@xmlns:wgs84_pos":"http://www.w3.org/2003/01/geo/wgs84_pos","@xmlns:foaf":"http://xmlns.com/foaf/0.1/","@xmlns:rdaGr2":"http://rdvocab.info/ElementsGr2","@xmlns:oai":"http://www.openarchives.org/OAI/2.0/","@xmlns:owl":"http://www.w3.org/2002/07/owl#","@xmlns:rdf":"http://www.w3.org/1999/02/22-rdf-syntax-ns#","@xmlns:ore":"http://www.openarchives.org/ore/terms/","@xmlns:skos":"http://www.w3.org/2004/02/skos/core#","@xmlns:dcterms":"http://purl.org/dc/terms/","edm:WebResource":[{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-6DGNHD5J/103d2831-3db0-4bd8-9646-46c813ef7fd9/PDF","dcterms:extent":"363 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-6DGNHD5J/52efc456-c21c-4d88-ada7-802127a0fa15/TEXT","dcterms:extent":"31 KB"}],"edm:TimeSpan":{"@rdf:about":"2008-2025","edm:begin":{"@xml:lang":"en","#text":"2008"},"edm:end":{"@xml:lang":"en","#text":"2025"}},"edm:ProvidedCHO":{"@rdf:about":"URN:NBN:SI:doc-6DGNHD5J","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR"},{"@xml:lang":"sl","#text":"Ars mathematica contemporanea"}],"dcterms:issued":"2017","dc:creator":["Godsil, Christopher David","Meagher, Karen"],"dc:format":[{"@xml:lang":"sl","#text":"letnik:12"},{"@xml:lang":"sl","#text":"številka:2"},{"@xml:lang":"sl","#text":"str. 205-217"}],"dc:identifier":["COBISSID:18120281","ISSN:1855-3966","URN:URN:NBN:SI:doc-6DGNHD5J"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije"},"dc:subject":[{"@xml:lang":"sl","#text":"Erdős-Ko-Radov izrek"},{"@xml:lang":"sl","#text":"grafi"},{"@xml:lang":"sl","#text":"neodvisne množice"},{"@xml:lang":"sl","#text":"popolno prirejanje"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"An algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings|"},"dc:description":[{"@xml:lang":"sl","#text":"We give a proof that the largest set of perfect matchings, in which any two contain a common edge, is the set of all perfect matchings that contain a fixed edge. This is a version of the famous Erdős-Ko-Rado theorem for perfect matchings. The proof given in this paper is algebraic, we first determine the least eigenvalue of the perfect matching derangement graph and then use properties of the perfect matching polytope to prove the result"},{"@xml:lang":"sl","#text":"V članku podamo dokaz, da je največja množica popolnih prirejanj, v kateri poljubni dve vsebujeta skupno povezavo, množica vseh popolnih prirejanj, ki vsebujejo neko fiksno povezavo. To je različica slavnega Erdős-Ko-Radovega izreka za popolna prirejanja. Naš dokaz je algebraičen, najprej določimo najmanjšo lastno vrednost grafa prerazporeditev popolnih prirejanj, potem pa uporabimo lastnosti politopa popolnih prirejanj, da dokažemo naš rezultat"}],"edm:type":"TEXT","dc:type":[{"@xml:lang":"sl","#text":"znanstveno časopisje"},{"@xml:lang":"en","#text":"journals"},{"@rdf:resource":"http://www.wikidata.org/entity/Q361785"}]},"ore:Aggregation":{"@rdf:about":"http://www.dlib.si/?URN=URN:NBN:SI:doc-6DGNHD5J","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-6DGNHD5J"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-6DGNHD5J/103d2831-3db0-4bd8-9646-46c813ef7fd9/PDF"},"edm:rights":{"@rdf:resource":"http://creativecommons.org/licenses/by/4.0/"},"edm:provider":"Slovenian National E-content Aggregator","edm:intermediateProvider":{"@xml:lang":"en","#text":"National and University Library of Slovenia"},"edm:dataProvider":{"@xml:lang":"sl","#text":"Univerza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije"},"edm:object":{"@rdf:resource":"http://www.dlib.si/streamdb/URN:NBN:SI:doc-6DGNHD5J/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-6DGNHD5J"}}}}