{"?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-G44RD9FV/B4912BB2-0C50-4751-B77E-D3EF545A7337/PDF","dcterms:extent":"0 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-G44RD9FV/1a6c8bec-fa37-48fa-8801-0bc538d48b04/PDF","dcterms:extent":"173 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-G44RD9FV/a95075db-6bfd-4581-98cf-713e99b7858c/TEXT","dcterms:extent":"7 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-G44RD9FV","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR"},{"@xml:lang":"sl","#text":"Ars mathematica contemporanea"}],"dcterms:issued":"2011","dc:creator":["Albertson, Michael O.","Pach, János","Young, Michael E."],"dc:format":[{"@xml:lang":"sl","#text":"številka:1"},{"@xml:lang":"sl","#text":"letnik:4"},{"@xml:lang":"sl","#text":"str. 1-4"}],"dc:identifier":["COBISSID:16089945","ISSN:1855-3966","URN:URN:NBN:SI:doc-G44RD9FV"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"Društvo matematikov, fizikov in astronomov Slovenije"},"dc:subject":[{"@xml:lang":"en","#text":"Golumb ruler"},{"@xml:lang":"en","#text":"graph distances"},{"@xml:lang":"en","#text":"graph theory"},{"@xml:lang":"en","#text":"homometric subsets"},{"@xml:lang":"sl","#text":"homometrične podmnožice"},{"@xml:lang":"sl","#text":"ravninski grafi"},{"@xml:lang":"sl","#text":"razdalje v grafih"},{"@xml:lang":"sl","#text":"teorija grafov"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"Disjoint homometric sets in graphs|"},"dc:description":{"@xml:lang":"sl","#text":"Two subsets of vertices in a graph are called homometric if the multisets of distances determined by them are the same. Let ?$h(n)$? denote the largest number ?$h$? such that any connected graph of ?$n$? vertices contains two disjoint homometric subsets of size ?$h$?. It is shown that ?$\\frac{c \\log n}{\\log\\log n} < h(n) < \\frac{n}{4}$?, for ?$n > 3$?"},"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-G44RD9FV","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-G44RD9FV"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-G44RD9FV/B4912BB2-0C50-4751-B77E-D3EF545A7337/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-G44RD9FV/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-G44RD9FV"}}}}