Almost spanning monochromatic k-connected subgraphs
主 题: Almost spanning monochromatic k-connected subgraphs
报告人: Professor Coltan Magnant (Georgia Southern University)
时 间: 2016-03-16 16:00 - 17:00
地 点: 理科一号楼 1493
High connectivity of a graph or network is critical in many applications. In edge-colored graphs, we consider conditions which imply the existence of a large highly connected one-colored subgraph. To this end, we forbid certain rainbow or properly colored subgraphs.
