{"?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-RW379VPB/422b503c-9c7b-4591-835a-9f5d2c5d19d6/PDF","dcterms:extent":"363 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-RW379VPB/f76695ca-4619-4515-97a2-8b401e0f5e29/TEXT","dcterms:extent":"40 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-RW379VPB","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":["Yuan, Long-Tu","Zhang, Xiao-Dong"],"dc:format":[{"@xml:lang":"sl","#text":"številka:1"},{"@xml:lang":"sl","#text":"letnik:13"},{"@xml:lang":"sl","#text":"str. 49-61"}],"dc:identifier":["COBISSID:18173785","ISSN:1855-3966","URN:URN:NBN:SI:doc-RW379VPB"],"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":"drevo"},{"@xml:lang":"sl","#text":"Erdős-Sósova domneva"},{"@xml:lang":"sl","#text":"maksimalna stopnja"},{"@xml:lang":"sl","#text":"teorija grafov"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"On the Erdős-Sós Conjecture for graphs on n = k + 4 vertices|"},"dc:description":[{"@xml:lang":"sl","#text":"The Erdős-Sós Conjecture states that if ?$G$? is a simple graph of order ?$n$? with average degree more than ?$k-2$?, then ?$G$? contains every tree of order ?$k$?. In this paper, we prove that Erdős-Sós Conjecture is true for ?$n=k+4$?"},{"@xml:lang":"sl","#text":"Erdős-Sósova domneva pravi, da če je ?$G$? enostaven graf reda ?$n$? s povprečno stopnjo večjo od ?$k-2$?, potem ?$G$? vsebuje vsako drevo reda ?$k$?. V tem članku pokaževa, da je Erdős-Sósova domneva resnična za ?$n=k+4$?"}],"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-RW379VPB","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-RW379VPB"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-RW379VPB/422b503c-9c7b-4591-835a-9f5d2c5d19d6/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-RW379VPB/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-RW379VPB"}}}}