Induced packing treewidth III. Branch decompositions
math.CO, cs.DM
Submitted: 2026-11-09
Updated: 2026-11-09
Terminology
Sources
- Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
- An alternative characterisation of graphs quasi-isometric to graphs of bounded treewidth
- Graphs that are quasi-isometric to graphs with bounded treewidth
- Asymptotic structure. I. Coarse tree-width
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality