<?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-N4BQROJ1/9774b2d4-8d7a-47c6-9b64-5052d3c04686/PDF"><dcterms:extent>413 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-N4BQROJ1/1695e737-69a0-4cba-b43a-3adbee557144/TEXT"><dcterms:extent>64 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-N4BQROJ1/ee572231-7796-441f-a206-475d3952c778/PDF"><dcterms:extent>96 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-N4BQROJ1/8705102f-3423-4020-be2f-1b9bdaf780a4/TEXT"><dcterms:extent>4 KB</dcterms:extent></edm:WebResource><edm:ProvidedCHO rdf:about="URN:NBN:SI:doc-N4BQROJ1"><dcterms:issued>2026</dcterms:issued><dc:creator>Burgess, Andrea</dc:creator><dc:creator>Jones, Caleb W.</dc:creator><dc:creator>Pike, David A.</dc:creator><dc:format xml:lang="sl">letnik:26</dc:format><dc:format xml:lang="sl">številka:3, article  p3.07</dc:format><dc:format xml:lang="sl">str. 1-23</dc:format><dc:identifier>DOI:10.26493/1855-3974.3451.46f</dc:identifier><dc:identifier>ISSN:1855-3974</dc:identifier><dc:identifier>COBISSID_HOST:289921027</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-N4BQROJ1</dc:identifier><dc:language>en</dc:language><dc:publisher xml:lang="sl">Univerza na Primorskem</dc:publisher><dc:source xml:lang="sl">Ars mathematica contemporanea</dc:source><dc:subject xml:lang="en">combinatorial games on graphs</dc:subject><dc:subject xml:lang="en">graph burning</dc:subject><dc:subject xml:lang="en">graph searching</dc:subject><dc:subject xml:lang="en">hypergraph theory</dc:subject><dc:subject xml:lang="sl">kombinatorne igre na grafih</dc:subject><dc:subject xml:lang="sl">požiganje grafov</dc:subject><dc:subject xml:lang="sl">preiskovanje grafov</dc:subject><dc:subject xml:lang="en">pursuit-evasion</dc:subject><dc:subject xml:lang="sl">teorija hipergrafov</dc:subject><dc:subject xml:lang="sl">zasledovanje in izmikanje</dc:subject><dc:title xml:lang="sl">Extending graph burning to hypergraphs|</dc:title><dc:description xml:lang="sl">Graph burning is a round-based game or process that discretely models the spread of influence throughout a network. We introduce a generalization of graph burning which applies to hypergraphs, as well as a variant called "lazy" hypergraph burning. Interestingly, lazily burning a graph is trivial, while lazily burning a hypergraph can be quite complicated. Moreover, the lazy burning model is a useful tool for analyzing the round-based model. One of our key results is that arbitrary hypergraphs do not satisfy a bound analogous to the one in the Burning Number Conjecture for graphs. We also obtain bounds on the burning number and lazy burning number of a hypergraph in terms of its parameters, and present several open problems in the field of (lazy) hypergraph burning</dc:description><dc:description xml:lang="sl">Požiganje grafov je krožna igra oziroma proces, ki na diskreten način modelira širjenje vpliva po omrežju. V tem članku uvedemo posplošitev požiganja grafov na hipergrafe ter različico, imenovano “lenobno” požiganje hipergrafov. Zanimivo je, da je lenobno požiganje grafov trivialen proces, medtem ko je lahko lenobno požiganje hipergrafov precej zapleteno. Poleg tega se model lenobnega požiganja izkaže kot uporabno orodje za analizo krožnega modela požiganja. Eden naših osrednjih rezultatov je dokaz, da poljubni hipergrafi ne zadoščajo oceni, analogni tisti iz domneve o številu požiganja za grafe. Nadalje izpeljemo zgornje in spodnje meje za število požiganja in lenobno število požiganja hipergrafa glede na njegove parametre ter predstavimo več odprtih problemov na področju (lenobnega) požiganja hipergrafov</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-N4BQROJ1"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-N4BQROJ1" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-N4BQROJ1/9774b2d4-8d7a-47c6-9b64-5052d3c04686/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-N4BQROJ1/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-N4BQROJ1" /></ore:Aggregation></rdf:RDF>