{"?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-L5NKNMDP/2f9109e2-8ba0-435e-9103-415034be2a6a/PDF","dcterms:extent":"547 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:DOC-L5NKNMDP/161762a2-8f3d-468d-92c8-74e866056968/TEXT","dcterms:extent":"0 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:DOC-L5NKNMDP/a5ab9a38-4a4e-4fb1-9470-666469f85d1b/PDF","dcterms:extent":"193 KB"}],"edm:ProvidedCHO":{"@rdf:about":"URN:NBN:SI:DOC-L5NKNMDP","dcterms:issued":"2025","dc:creator":["Araujo-Pardo, Gabriela","Kiss, György","Porupsánszki, István"],"dc:format":[{"@xml:lang":"sl","#text":"številka:3, article  p3.05"},{"@xml:lang":"sl","#text":"letnik:8"},{"@xml:lang":"sl","#text":"str. 1-21"}],"dc:identifier":["DOI:10.26493/2590-9770.1733.dc9","COBISSID_HOST:237299715","ISSN:2590-9770","URN:URN:NBN:SI:doc-L5NKNMDP"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"Fakulteta za matematiko, naravoslovje in informacijske tehnologije"},"dc:source":{"@xml:lang":"sl","#text":"The art of discrete and applied mathematics"},"dc:subject":[{"@xml:lang":"en","#text":"cage problem"},{"@xml:lang":"en","#text":"edge-girth-regular graph"},{"@xml:lang":"en","#text":"finite biaffine planes"}],"dc:title":{"@xml:lang":"sl","#text":"On extremal (almost) edge-girth-regular graphs|"},"dc:description":{"@xml:lang":"sl","#text":"A k-regular graph of girth g is called an edge-girth-regular graph, or an egr-graph forshort, if each of its edges is contained in exactly ? distinct g-cycles. An egr-graph is called extremal for the triple (k,g,?) if it has the smallest possible order. We prove that somegraphs arising from incidence graphs of finite planes are extremal egr-graphs. We also prove new lower bounds on the order of egr-graphs"},"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-L5NKNMDP","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:DOC-L5NKNMDP"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:DOC-L5NKNMDP/2f9109e2-8ba0-435e-9103-415034be2a6a/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-L5NKNMDP/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:DOC-L5NKNMDP"}}}}