Abstract: In this paper we consider some problems of graph theory from the linear algebra point of view. It turns out, that this approach allows us to prove certain theorems on minimum edge coverings ...
David Conlon and Asaf Ferber have raised the lower bound for multicolor “Ramsey numbers,” which quantify how big graphs can get before patterns inevitably emerge. “There is no absolute randomness in ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results