University of Cambridge > Talks.cam > Combinatorics Seminar > Layered subgraphs of 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

Layered subgraphs of the hypercube

Download to your calendar using vCal

  • UserKada Williams (Cambridge)
  • ClockThursday 14 November 2024, 14:30-15:30
  • HouseMR12.

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

First, we discuss an abstract property of hypercube subgraphs, demonstrating that a certain labelling of its edges guarantees its embedding. Furthermore, we show that imposing an additional condition can ensure that a labelled graph embeds in a layer of the hypercube. For example, the hypercube of dimension two embeds in a hypercube, yet cannot embed in a layer. We prove that such a graph can be taken to have arbitrarily large girth, and even to be induced as a subgraph of a hypercube.

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

Morison Room, Cambridge University Library Type the title of a new list herecircle Bryan Matthews Seminar Room, Physiology Building, Downing Site

Other talks

Thelocactus Seminars in Cancer Group Work Tea and Coffee Break Morning Break TBC
 

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