Independent spanning trees, often realised as completely independent spanning trees (CISTs), form a foundational concept in network design and routing. They consist of multiple spanning trees ...

Recently, Knuth and Ciucu independently proved the surprising fact, conjectured by Stanley, that one connected component of the tensor product of a path with itself (the so-called "Aztec diamond graph ...

As computer networks get bigger, it becomes increasingly hard to keep track of the flow of data over this network. How do you route data, making sure that the data is spread to all parts of the ...

Citations: Vohra, Rakesh. 1984. Counting Spanning Trees in a Graph of Kleitman and Golden and its Generalization. Journal of the Franklin Institute. (5)349-355.