BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Layered subgraphs of the hypercube - Kada Williams (Cambridge)
DTSTART:20241114T143000Z
DTEND:20241114T153000Z
UID:TALK224770@talks.cam.ac.uk
CONTACT:103978
DESCRIPTION: First\, we discuss an abstract property of hypercube subgraph
 s\, demonstrating that a certain labelling of its edges guarantees its emb
 edding. Furthermore\, we show that imposing an additional condition can en
 sure 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 l
 arge girth\, and even to be induced as a subgraph of a hypercube.\n  
LOCATION:MR12
END:VEVENT
END:VCALENDAR