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 ...

On Wednesday the 22nd of June 2022, M.Sc. Massimo Equi defends his doctoral thesis on Lower and Upper Bounds for String Matching in Labelled Graphs. The thesis is related to research done in the ...

Consists of six departments and provides education in the fields of physics, mathematics, chemistry, informatics, biology and ecology, geography and tourism. Almost all courses of study programmes ...

This is a preview. Log in through your library . Abstract We outline a new lower bound on graph entropy and discuss some of its applications. In particular, our results allow us to calculate the graph ...