2 problems

Chi-boundedness conjecture. For any two integers $k,c\in\mathbb{N}$ there exists an integer $r$ such that every graph with induced matching treewidth at most $k$ and clique number…

Tree-independence conjecture. For any two integers $k,t\in\mathbb{N}$ there exists an integer $r$ such that every graph with induced matching treewidth at most $k$ and no induced s…