MENU

You are here

Enumeration problems on hypertrees

Andrew Newman
Institution: 
TU Berlin
Location: 
A-133
Schedule: 
Tuesday, February 18, 2020 - 16:00
Abstract: 

It is often the case that equivalent properties for graphs generalize to nonequivalent properties for higher dimensional simplicial complexes. In this talk we consider several equivalent properties for trees (beyond acyclic, connected, and n - 1 edges) that have natural, but nonequivalent, topological or combinatorial analogues in higher dimension. Thus there are several ways one could naturally define a hypertree. This leads to many interesting questions (and some answers) that we will discuss in this talk.

Sign in