3 papers
math.CO2026
Tree-partitions and small-spread tree-decompositions
Marc Distel, Neel Kaul, Raj Kaul +1
Tree-decompositions and treewidth are of fundamental importance in structural and algorithmic graph theory. The "spread" of a tree-decomposition is the minimum integer such tha…
math.CO2026
On Universal Graphs for Trees and Tree-Like Graphs
Neel Kaul, Jaehoon Kim, Minseo Kim +1
Chung and Graham [J. London Math. Soc. 1983] claimed to prove that there exists an -vertex graph with edges that contains every -vertex tr…
math.CO2025
On universal graphs for trees and treewidth graphs
Neel Kaul, David R. Wood
Let be the minimum number of edges in a graph that contains every -vertex tree as a subgraph. Chung and Graham [J. London Math. Soc. 1983] claim to prove that $s(n)\leqsl…