论文标题
部分可观测时空混沌系统的无模型预测
Monochromatic paths in $2$-edge coloured graphs and hypergraphs
论文作者
论文摘要
我们回答了2013年Gyárfás和Sárközy的一个问题，该问题表明，每个2边彩色的完整3均匀的超图可以分为两种不同颜色的单色紧密路径。我们还为分区任何2厚度的完整R-Partite R-均匀的超图所需的紧密路径数量提供了下限。最后，我们表明，任何2边彩色的完整二分图都具有单色循环和不同颜色的单色路径的分区，除非颜色是分裂的着色。
We answer a question of Gyárfás and Sárközy from 2013 by showing that every 2-edge-coloured complete 3-uniform hypergraph can be partitioned into two monochromatic tight paths of different colours. We also give a lower bound for the number of tight paths needed to partition any 2-edge-coloured complete r-partite r-uniform hypergraph. Finally, we show that any 2-edge-coloured complete bipartite graph has a partition into a monochromatic cycle and a monochromatic path, of different colours, unless the colouring is a split colouring.
