Topological combinatorics

该项目研究不同组合对象的拓扑结构。在这个广泛的主题中有两个主要的兴趣领域：1。可嵌入性：该项目寻找不同组合对象的可嵌入性特征。沿着特征化，也需要有效的算法。当没有有效的算法是可能的，NP-困难的证明是必要的。分解性：该项目着眼于分解组合结构的方法，以保持某些属性。这第二个一般主题包括连接理论和调查宽度措施捆绑到分解。研究嵌入性的方法通常使用分解理论。

The project investigates the topological structures of different combinatorial objects. There are two main areas of interest within this broad theme:1. Embeddability : the project looks for characterisations of embeddability of different combinatorial objects. Along with characterisations, efficient algorithms are also desired. When no efficient algorithm is possible, a proof of NP-hardness is desired.2. Decompositionality : the project looks at ways of decomposing combinatorial structures that preserves certain properties. This second general theme includes connectivity theory and investigating width measures tied to decompositions. The methods involved in studying embeddability usually use theory from decompositionality.