On connected components with many edges
暂无分享,去创建一个
[1] Gábor N. Sárközy,et al. Large monochromatic components in multicolored bipartite graphs , 2020, J. Graph Theory.
[2] Gábor N. Sárközy,et al. Large Monochromatic Components in Edge Colored Graphs with a Minimum Degree Condition , 2017, Electron. J. Comb..
[3] Masatoshi Osumi. Ramsey Numbers of Trails , 2021, ArXiv.
[4] Miklós Ruszinkó. Large components in r-edge-colorings of Kn have diameter at most five , 2012, J. Graph Theory.
[5] András Gyárfás,et al. Large Monochromatic Components in Edge Colorings of Graphs: A Survey , 2011 .
[6] David Conlon,et al. Ramsey numbers of trails and circuits , 2021 .