1. Treewidth versus clique number. v. further connections with tree‐independence numberClaire Hilaire, Martin Milanič, Ðorđe Vasić, 2026, izvirni znanstveni članek Opis: 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.
Ključne besede: clique number, hereditary graph class, line graph, tree‐independence number, treewidth
Objavljeno v RUP: 09.04.2026; Ogledov: 204; Prenosov: 9
 Celotno besedilo (1,87 MB)
Gradivo ima več datotek! Več... |
2. Excluding an induced wheel minor in graphs without large induced starsMujin Choi, Claire Hilaire, Martin Milanič, Sebastian Wiederrecht, 2026, objavljeni znanstveni prispevek na konferenci Opis: We study a conjecture due to Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht stating that for any positive integer d and any planar graph H, the class of all K_{1,d}-free graphs without H as an induced minor has bounded tree-independence number. A k-wheel is the graph obtained from a cycle of length k by adding a vertex adjacent to all vertices of the cycle. We show that the conjecture of Dallard et al. is true when H is a k-wheel for any k at least 3. Our proof uses a generalization of the concept of brambles to tree-independence number. As a consequence of our main result, several important NP-hard problems such as Maximum Independent Set are tractable on K_{1,d}-free graphs without large induced wheel minors. Moreover, for fixed d and k, we provide a polynomial-time algorithm that, given a K_{1,d}-free graph G as input, finds an induced minor model of a k-wheel in G if one exists.
Ključne besede: induced minor, wheel, tree-independence number, Maximum Independent Set
Objavljeno v RUP: 25.03.2026; Ogledov: 227; Prenosov: 2
 Povezava na datoteko
Gradivo ima več datotek! Več... |
3. Numerical semigroups with distances no admisible between gaps greater than its multiplicityJ. C. Rosales, Manuel B. Branco, Márcio A. Traesel, 2026, izvirni znanstveni članek Opis: Let A pabe a nonempty subset of positive integers. In this paper we study the set of numerical semigroups that fulfill: if {x,y} ⊆ ℕ\S and x > y > min(S\{0}), then x-y ∉ A.
Ključne besede: Frobenius pseudo-varieties, genus number, numerical semigroups, PD(A)-semigroup and tree (associated to a PD(A)-semigroup)
Objavljeno v RUP: 21.12.2025; Ogledov: 394; Prenosov: 18
Celotno besedilo (356,42 KB) |
4. Computing tree decompositions with small independence numberClément Jean Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanič, 2026, izvirni znanstveni članek Opis: The independence number of a tree decomposition is the maximum of the independence numbers of the subgraphs induced by its bags. The tree-independence number of a graph is the minimum independence number of a tree decomposition of it. Several NP-hard graph problems, like maximum-weight independent set, can be solved in time n^O(k) if the input n-vertex graph is given together with a tree decomposition of independence number k. Yolov, in SODA 2018, gave an algorithm that, given an n-vertex graph G and an integer k, in time n^O(k^3) either constructs a tree decomposition of G whose independence number is O(k^3) or correctly reports that the tree-independence number of G is larger than k. In this article, we first give an algorithm for computing the tree-independence number with a better approximation ratio and running time and then prove that our algorithm is, in some sense, the best one can hope for. Our second result is that the exact computation of the tree-independence number is para-NP-hard: We show that for every constant k ≥ 4 it is NP-complete to decide whether a given graph has the tree-independence number at most k.
Ključne besede: tree-independence number, approximation, parameterized algorithm
Objavljeno v RUP: 16.12.2025; Ogledov: 458; Prenosov: 5
Celotno besedilo (1,45 MB)
Gradivo ima več datotek! Več... |
5. Induced minor models : Structural properties and algorithmic consequencesNicolas Bousquet, Clément Jean Dallard, Maël Dumas, Claire Hilaire, Martin Milanič, Anthony Perez, Nicolas Trotignon, 2026, izvirni znanstveni članek Opis: A graph H is an induced minor of G if there exists an induced minor model of H in G, that is, a collection of pairwise disjoint subsets of vertices of G labeled by the vertices of H, each inducing a connected subgraph in G, such that two vertices of H are adjacent if and only if there is an edge in G between the corresponding subsets. In this paper, we investigate structural properties of induced minor models, including bounds on treewidth and chromatic number of the subgraphs induced by minimal induced minor models. As algorithmic applications of our structural results, we make use of recent developments regarding tree-independence number to show that if H is the 4-wheel, the 5-vertex complete graph minus an edge, or a complete bipartite graph K2,q , then there is a polynomial-time algorithm to find in a given graph G an induced minor model of H in G, if there is one. We also develop an alternative polynomial-time algorithm for recognizing graphs that do not contain K2,3 as an induced minor, which revolves around the idea of detecting the induced subgraphs whose presence is forced when the input graph contains K2,3 as an induced minor. It turns out that all these induced subgraphs are Truemper configurations.
Ključne besede: induced minor, treewidth, chromatic number, tree-independence number, Truemper configuration
Objavljeno v RUP: 16.12.2025; Ogledov: 463; Prenosov: 3
Celotno besedilo (1,44 MB)
Gradivo ima več datotek! Več... |
6. On relationships between treewidth, clique number, tree-independence number, and induced minors : master’s thesisÐorđe Vasić, 2025, magistrsko delo Ključne besede: treewidth, clique number, tree-independence number, induced minor, hered itary graph class, bipartite chain graph
Objavljeno v RUP: 11.09.2025; Ogledov: 1069; Prenosov: 10
Celotno besedilo (839,36 KB) |
7. |
