<?xml version="1.0"?><rdf: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-KDW545IQ/0d8c2019-5b32-4f2f-b00e-8aba39643425/PDF"><dcterms:extent>286 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-KDW545IQ/55d70bd9-76b6-451c-8b61-8cb4496d41ec/TEXT"><dcterms:extent>15 KB</dcterms:extent></edm:WebResource><edm:TimeSpan rdf:about="2008-2025"><edm:begin xml:lang="en">2008</edm:begin><edm:end xml:lang="en">2025</edm:end></edm:TimeSpan><edm:ProvidedCHO rdf:about="URN:NBN:SI:doc-KDW545IQ"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR" /><dcterms:issued>2019</dcterms:issued><dc:creator>Anholcer, Marcin</dc:creator><dc:creator>Bosek, Bartłomiej</dc:creator><dc:creator>Grytczuk, Jarosław</dc:creator><dc:format xml:lang="sl">številka:1</dc:format><dc:format xml:lang="sl">letnik:16</dc:format><dc:format xml:lang="sl">str. 111-117</dc:format><dc:identifier>ISSN:1855-3966</dc:identifier><dc:identifier>COBISSID_HOST:18703193</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-KDW545IQ</dc:identifier><dc:language>en</dc:language><dc:publisher xml:lang="sl">Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije</dc:publisher><dcterms:isPartOf xml:lang="sl">Ars mathematica contemporanea</dcterms:isPartOf><dc:subject xml:lang="en">1-2-3 conjecture</dc:subject><dc:subject xml:lang="sl">1-2-3 domneva</dc:subject><dc:subject xml:lang="en">combinatorial nullstellensatz</dc:subject><dc:subject xml:lang="sl">kombinatorični izrek o položaju ničel</dc:subject><dc:subject xml:lang="en">list weighting</dc:subject><dc:subject xml:lang="en">oriented hypergraphs</dc:subject><dc:subject xml:lang="sl">orientirani hipergrafi</dc:subject><dc:subject xml:lang="sl">ponderiranje seznama</dc:subject><dcterms:temporal rdf:resource="2008-2025" /><dc:title xml:lang="sl">Weight choosability of oriented hypergraphs|</dc:title><dc:description xml:lang="sl">The 1-2-3 conjecture states that every simple graph (with no isolated edges) has an edge weigthing by numbers 1, 2, 3 such that the resulting weighted vertex degrees form a proper coloring of the graph. We study a similar problem for oriented hypergraphs. We prove that every oriented hypergraph has an edge weighting satisfying a similar condition, even if the weights are to be chosen from arbitrary lists of size two. The proof is based on the combinatorial nullstellensatz and a theorem of I. Schur Math. Z. 1, 184--207 (1918) for permanents of positive semi-definite matrices. We derive several consequences of the main result for uniform hypergraphs. We also point on possible applications of our results to problems of 1-2-3 type for non-oriented hypergraphs</dc:description><dc:description xml:lang="sl">1-2-3 domneva izjavlja, da za vsak enostaven graf (brez izoliranih povezav) obstaja obtežitev povezav s števili 1, 2, 3, tako da rezultirajoče utežene stopnje vozlišč tvorijo pravilno barvanje grafa. Raziskujemo podoben problem za orientirane hipergrafe. Dokažemo, da ima vsak orientiran hipergraf obtežitev povezav, ki zadošča podobnemu pogoju, tudi če je uteži treba izbirati iz poljubnega seznama dolžine dve. Dokaz je osnovan na kombinatoričnem izreku o položajih ničel in Schurovem izreku za permanente pozitivnih semi-definitnih matrik. Izpeljemo več posledic glavnega rezultata za uniformne hipergrafe. Opozorimo tudi na možne uporabe naših rezultatov pri problemih tipa 1-2-3 za neorientirane hipergrafe</dc:description><edm:type>TEXT</edm:type><dc:type xml:lang="sl">znanstveno časopisje</dc:type><dc:type xml:lang="en">journals</dc:type><dc:type rdf:resource="http://www.wikidata.org/entity/Q361785" /></edm:ProvidedCHO><ore:Aggregation rdf:about="http://www.dlib.si/?URN=URN:NBN:SI:doc-KDW545IQ"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-KDW545IQ" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-KDW545IQ/0d8c2019-5b32-4f2f-b00e-8aba39643425/PDF" /><edm:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/" /><edm:provider>Slovenian National E-content Aggregator</edm:provider><edm:intermediateProvider xml:lang="en">National and University Library of Slovenia</edm:intermediateProvider><edm:dataProvider xml:lang="sl">Univerza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije</edm:dataProvider><edm:object rdf:resource="http://www.dlib.si/streamdb/URN:NBN:SI:doc-KDW545IQ/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-KDW545IQ" /></ore:Aggregation></rdf:RDF>