The wall-subdivision formulation of the induced-grid conjecture

Let dd be a positive integer and let C\mathcal{C} be a hereditary graph class excluding K1,dK_{1,d}. A subdivision of the elementary kk-wall is obtained by subdividing edges of the elementary kk-wall, and its line graph is formed by taking edges as vertices. The wall-subdivision formulation. The class C\mathcal{C} has bounded tree-independence number if and only if there exists a positive integer kk such that C\mathcal{C} excludes all subdivisions of the elementary kk-wall and their line graphs. This is stated as an equivalent induced-subgraph formulation of the induced-grid conjecture and remains open with that conjecture.

Sources & referencesView supporting material

Primary source

Clément Dallard, Matjaž Krnc, O-joung Kwon, Martin Milanič, Andrea Munaro, Kenny Štorgel and Sebastian Wiederrecht, “Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star”, arXiv:2402.11222 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.