Independent spanning trees in the hypercube

Add to your list(s) Download to your calendar using vCal

• Benedict Randall Shaw (Cambridge)
• Thursday 05 June 2025, 14:30-15:30
• MR12.

If you have a question about this talk, please contact ibl10.

We say two spanning trees of a graph are completely independent if their edge sets are disjoint, and for each pair of vertices, the paths between them in each spanning tree do not have any other vertex in common. Pai and Chang constructed two such spanning trees in the hypercube Q_n for sufficiently large n, while Kandekar and Mane recently showed there are 3 pairwise completely independent spanning trees in hypercubes Q_n for sufficiently large n. We prove that for each k, there exist k completely independent spanning trees in Q_n for sufficiently large n. In fact, we show that there are (1/12+o(1))n spanning trees in Q_n.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.