{"?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-KLFC1CH3/3FB7C022-48ED-4124-903E-EAECFA11EED3/PDF","dcterms:extent":"0 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-KLFC1CH3/c298eb2a-2e47-4a09-b661-3681f76562cf/PDF","dcterms:extent":"295 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-KLFC1CH3/901073b7-6597-442e-934a-287274d574da/TEXT","dcterms:extent":"30 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-KLFC1CH3","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":["Streinu, Ileana","Theran, Louis"],"dc:format":[{"@xml:lang":"sl","#text":"številka:1"},{"@xml:lang":"sl","#text":"letnik:4"},{"@xml:lang":"sl","#text":"str. 141-151"}],"dc:identifier":["COBISSID:16265561","ISSN:1855-3966","URN:URN:NBN:SI:doc-KLFC1CH3"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"Društvo matematikov, fizikov in astronomov Slovenije"},"dc:subject":[{"@xml:lang":"en","#text":"combinatorial rigidity"},{"@xml:lang":"en","#text":"graph theory"},{"@xml:lang":"sl","#text":"kombinatorična rigidnost"},{"@xml:lang":"sl","#text":"matroidi"},{"@xml:lang":"en","#text":"matroids"},{"@xml:lang":"sl","#text":"redki grafi"},{"@xml:lang":"sl","#text":"redki hipergrafi"},{"@xml:lang":"en","#text":"sparse graphs"},{"@xml:lang":"en","#text":"sparse hypergraphs"},{"@xml:lang":"sl","#text":"teorija grafov"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"Natural realizations of sparsity matroids|"},"dc:description":{"@xml:lang":"sl","#text":"A hypergraph ?$G$? with ?$n$? vertices and ?$m$? hyperedges with ?$d$? endpoints each is ?$(k,\\ell )$?-sparse if for all sub-hypergraphs ?$G^\\prime$? on ?$n^\\prime$? vertices and ?$m^\\prime$? edges, ?$m^\\prime \\leq kn^\\prime - \\ell$?. For integers ?$k$? and ?$\\ell$? satisfying ?$0 \\leq \\ell \\leq dk - 1$?, this is known to be a linearly representable matroidal family. Motivated by problems in rigidity theory, we give a new linear representation theorem for the ?$(k,\\ell)$?-sparse hypergraphs that is natural; i.e., the representing matrix captures the vertex-edge incidence structure of the underlying hypergraph ?$G$?"},"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-KLFC1CH3","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-KLFC1CH3"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-KLFC1CH3/3FB7C022-48ED-4124-903E-EAECFA11EED3/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-KLFC1CH3/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-KLFC1CH3"}}}}