University of Cambridge > Talks.cam > Combinatorics Seminar > Independent spanning trees in the hypercube

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Independent spanning trees in the hypercube

Download to your calendar using vCal

  • UserBenedict Randall Shaw (Cambridge)
  • ClockThursday 05 June 2025, 14:30-15:30
  • HouseMR12.

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

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:

Note that ex-directory lists are not shown.

Other lists

Hybrid: Seminar room, SPRI & Zoom - email organiser for details Goldsmiths 1, Lecture Theatre, Department of Materials Science & Metallurgy Hybrid: JDB Teaching Room, Engineering Department or Zoom: https://eng-cam.zoom.us/j/81927138251?pwd=TVd3MXliV003dUdYVlFwU2NDWGpmdz09

Other talks

CPH IRC and PHI Cambridge RNA Club - ONLINE Seminars in Cancer Welcome Reception and Poster Session Directing Disturbance: Three Theatremakers in Discussion TBC
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity