Lupa

Show document Help

A- | A+ | Print
Title:Extending graph burning to hypergraphs
Authors:ID Burgess, Andrea C. (Author)
ID Jones, Caleb W. (Author)
ID Pike, David A. (Author)
Files:.pdf AMC_Burgess,_Jones,_Pike_2026.pdf (413,95 KB)
MD5: 6C00EF8351AA6993F9D15AC2FD332248
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:ZUP - University of Primorska Press
Abstract: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.
Keywords:Combinatorial games on graphs, pursuit-evasion, graph searching, graph burning, hypergraph theory
Publication status:Published
Publication version:Version of Record
Publication date:18.06.2026
Publisher:Založba Univerze na Primorskem
Year of publishing:2026
Number of pages:23 str.
Numbering:Vol. 26, no. 3, [article no.] P3.07
PID:20.500.12556/RUP-23517 This link opens in a new window
UDC:51
eISSN:1855-3974
DOI:10.26493/1855-3974.3451.46f This link opens in a new window
Publication date in RUP:18.08.2026
Views:24
Downloads:0
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Ars mathematica contemporanea
Publisher:Založba Univerze na Primorskem
ISSN:1855-3974

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Title:Posplošitev požiganja grafov na hipergrafe
Abstract: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.
Keywords:Kombinatorne igre na grafih, zasledovanje in izmikanje, preiskovanje grafov, poži- ganje grafov, teorija hipergrafov


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica