MathDB1 problem
- 0 votes0 replies0 views
Tree-independence conjecture for theta-, prism-, and forest-free graphs
A theta is a graph consisting of two non-adjacent ends joined by three pairwise internally disjoint paths of length at least two whose interiors are pairwise anticomplete. A prism…