搜索结果: 1-2 共查到“组合数学 Constructing”相关记录2条 . 查询时间(0.031 秒)
Constructing graphs with no immersion of large complete graphs
Graph immersion minimum degree chromatic number edgeconnectivity Hajos Conjecture Hadwiger Conjecture graph minor
2012/6/29
In 1989, Lescure and Meyniel proved, for $d=5, 6$, that every $d$-chromatic graph contains an immersion of $K_d$, and in 2003 Abu-Khzam and Langston conjectured that this holds for all $d$. In 2010, D...
A method for constructing random matrix models of disordered bosons
random matrix models disordered bosons
2011/2/22
Random matrix models of disordered bosons consist of matrices in the Lie algebra g = spn(R). Assuming dynamical stability, their eigenvalues are required to be purely imaginary.