{"?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-RQ0NNP9E/f6b7d99c-8a75-4b6f-b508-3c441222faa6/PDF","dcterms:extent":"475 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-RQ0NNP9E/b0affbaa-68ff-458b-b724-05fa82e85cac/TEXT","dcterms:extent":"22 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-RQ0NNP9E","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR"},{"@xml:lang":"sl","#text":"Ars mathematica contemporanea"}],"dcterms:issued":"2018","dc:creator":["Martínez-Pérez, Álvaro","Montejano, Luis","Oliveros, Deborah"],"dc:format":[{"@xml:lang":"sl","#text":"letnik:14"},{"@xml:lang":"sl","#text":"številka:2"},{"@xml:lang":"sl","#text":"445-454"}],"dc:identifier":["COBISSID:18465625","ISSN:1855-3966","URN:URN:NBN:SI:doc-RQ0NNP9E"],"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":"Turánova števila"},{"@xml:lang":"sl","#text":"usmerjeni grafi"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"A note on extremal results on directed acyclic graphs|"},"dc:description":{"@xml:lang":"sl","#text":"Članek obravnava maksimalno število povezav usmerjenega acikličnega grafa (UAG) z ?$n$? vozlišči glede na njegovo najdaljšo pot ?$\\ell$?. Dokažemo, da je v splošnem to število Turánovo število ?$t(n, l+1)$?, maksimalno število povezav v grafu z ?$n$? vozlišči brez klike velikosti ?$\\ell+2$?. Nadalje, poiščemo maksimalno število povezav v UAG, ki je bodisi reduciran, krepko reduciran ali ekstremno reduciran. Ta ekstremalni rezultat povežemo z družino presečnih grafov družin škatel s transverzalnim presekom"},"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-RQ0NNP9E","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-RQ0NNP9E"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-RQ0NNP9E/f6b7d99c-8a75-4b6f-b508-3c441222faa6/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-RQ0NNP9E/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-RQ0NNP9E"}}}}