Covering 3-Edge-Colored Random Graphs with Monochromatic Trees
暂无分享,去创建一个
[1] Béla Bollobás,et al. Modern Graph Theory , 2002, Graduate Texts in Mathematics.
[2] Benny Sudakov,et al. Monochromatic cycle covers in random graphs , 2018, Random Struct. Algorithms.
[3] Reinhard Diestel,et al. Graph Theory , 1997 .
[4] Paul Erdös,et al. Vertex coverings by monochromatic cycles and trees , 1991, J. Comb. Theory, Ser. B.
[5] Benny Sudakov,et al. Covering random graphs by monochromatic trees and Helly-type results for hypergraphs , 2019, 1902.05055.
[6] YOSHIHARU KOHAYAKAWA,et al. Monochromatic trees in random graphs , 2018, Mathematical Proceedings of the Cambridge Philosophical Society.
[7] J. A. Bondy,et al. Graph Theory , 2008, Graduate Texts in Mathematics.
[8] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[9] Benny Sudakov,et al. Covering Graphs by Monochromatic Trees and Helly-Type Results for Hypergraphs , 2019, Combinatorica.
[10] Penny E. Haxell,et al. On Ryser's conjecture , 2012, Electron. J. Comb..
[11] Ron Aharoni. Ryser's Conjecture for Tripartite 3-Graphs , 2001, Comb..
[12] Louis DeBiasio,et al. Partitioning Random Graphs into Monochromatic Components , 2017, Electron. J. Comb..
[13] John Robert Henderson. Permutation decomposition of (0,1)-matrices and decomposition transversals , 1971 .