For a given set M of positive integers, a well-known problem of Motzkin asked to determine the maximal asymptotic density of M-sets, denoted by μ(M), where an M-set is a set of non-negative integers ...
The field of graph drawing and crossing numbers occupies a pivotal position at the intersection of computational geometry and network visualisation. Researchers in this domain strive to develop ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback