Lupa

Show document Help

A- | A+ | Print
Title:Treewidth versus clique number. v. further connections with tree‐independence number
Authors:ID Hilaire, Claire (Author)
ID Milanič, Martin (Author)
ID Vasić, Ðorđe (Author)
Files:.pdf RAZ_Hilaire_Claire_2026.pdf (1,87 MB)
MD5: 56C4F2BC82B6F82A9483D2D2142D80D3
 
URL https://onlinelibrary.wiley.com/doi/10.1002/jgt.70036
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:IAM - Andrej Marušič Institute
UPR - University of Primorska
FAMNIT - Faculty of Mathematics, Science and Information Technologies
Abstract:We continue the study of (tw, ω)‐bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the tree‐independence number, a graph parameter introduced independently by Yolov in 2018 and by Dallard, Milanič, and Štorgel in 2024. Dallard et al. showed that bounded tree‐independence number is sufficient for (tw, ω)‐boundedness, and conjectured that the converse holds. While this conjecture has been recently disproved, it is still interesting to determine classes where the conjecture holds; for example, the conjecture is still open for graph classes excluding an induced star, as well as for finitely many forbidden induced subgraphs. In this paper, we identify further families of graph classes where (tw, ω)‐boundedness is equivalent to bounded tree‐independence number. We settle a number of cases of finitely many forbidden induced subgraphs, obtain several equivalent characterizations of (tw, ω)-boundedness in subclasses of the class of complements of line graphs, and give a short proof of a recent result of Ahn, Gollin, Huynh, and Kwon [SODA 2025] establishing bounded tree-independence number for graphs excluding a fixed induced star and a fixed number of independent cycles.
Keywords:clique number, hereditary graph class, line graph, tree‐independence number, treewidth
Publication date:08.04.2026
Year of publishing:2026
Number of pages:str. 1-15
Numbering:Vol. , iss.
PID:20.500.12556/RUP-22939 This link opens in a new window
UDC:519.17
ISSN on article:0364-9024
DOI:10.1002/jgt.70036 This link opens in a new window
COBISS.SI-ID:274621699 This link opens in a new window
Publication date in RUP:09.04.2026
Views:52
Downloads:2
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:Journal of graph theory
Shortened title:J. graph theory
Publisher:J. Wiley & Sons
ISSN:0364-9024
COBISS.SI-ID:25747712 This link opens in a new window

Document is financed by a project

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:I0-0035-2022
Name:Infrastrukturna skupina Univerze na Primorskem

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0285-2022
Name:Algebra, diskretna matematika, verjetnostni račun in teorija iger

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-60012-2025
Name:“Linearne kode preko posebnih razredov funkcij - relacije in načrtovanje

Funder:Other - Other funder or multiple funders
Project number:J1-70035
Name:Simetrije grafovskih produktov

Funder:Other - Other funder or multiple funders
Project number:J1-70046
Name:Simetrije v grafih skozi simplicialne avtomorfizme

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0370-2024
Name:Onkraj redkosti: razredi grafov in širinski parametri

Funder:Other - Other funder or multiple funders
Project number:0013103
Name:CogniCom

Licences

License:CC BY-NC 4.0, Creative Commons Attribution-NonCommercial 4.0 International
Link:http://creativecommons.org/licenses/by-nc/4.0/
Description:A creative commons license that bans commercial use, but the users don’t have to license their derivative works on the same terms.

Secondary language

Language:Slovenian
Abstract:V članku nadaljujemo s preučevanjem (tw, ω)-omejenih razredov grafov, torej hereditarnih razredov grafov, v katerih je za veliko drevesno širino odgovorna prisotnost velike klike, in razmerjem te lastnosti do omejenosti drevesnega neodvisnostnega števila, invariante grafov, ki so jo neodvisno uvedli Yolov leta 2018 ter Dallard, Milanič in Štorgel leta 2024. Dallard in sodelavci so pokazali, da je omejeno drevesno neodvisnostno število zadosten pogoj za (tw, ω)-omejenost, in postavili domnevo, da je pogoj tudi potreben. Čeprav je bila ta domneva nedavno ovržena, je še vedno zanimivo določiti razrede, kjer domneva velja; domneva je na primer še vedno odprta za razrede grafov, ki izključujejo neko fiksno inducirano zvezdo, kot tudi za končno število prepovedanih induciranih podgrafov. V tem članku identificiramo nadaljnje družine grafovskih razredov, kjer je (tw, ω)-omejenost enakovredna omejenemu drevesnemu neodvisnostnemu številu. Rešili smo številne primere za končno mnogo prepovedanih induciranih podgrafov, izpeljali več enakovrednih karakterizacij (tw, ω)-omejenosti v podrazredih razreda komplementov povezavnih grafov in podali kratek dokaz nedavnega rezultata Ahna, Gollina, Huynha in Kwona [SODA 2025], ki podaja omejenost drevesnega neodvisnostnega številega za grafe, ki izključujejo neko fiksno inducirano zvezdo in fiksno število paroma neodvisnih ciklov.
Keywords:klično število, hereditaren razred grafov, povezaven graf, drevesno neodvisnostno število, drevesna širina


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