A cover of a hypergraph is a collection of edges whose union contains all vertices. Let H = (V, E) be a k-uniform, D-regular hypergraph on n vertices, in which no two vertices are contained in more than o(D/e log D) edges as D tends to infinity. Our results include that if k = o(log D), then there is a cover of (1 + o(1))n/k edges, extending the known result that this holds for fixed k. On the ...

The smashing growth of the containers’ traffic within the Mediterranean seaports has forced most of the local governments to rethink the development policies of infrastructures, so to better match the new market requests. The idea that the efficiency of seaports may also lead to an economical development of the involved area, with beneficial social effects, like a growing number of employment o...

Spatially embedded complex networks, such as nervous systems, the Internet, and transportation networks, generally have nontrivial topological patterns of connections combined with nearly minimal wiring costs. However, the growth rules shaping these economical tradeoffs between cost and topology are not well understood. Here, we study the cellular nervous system of the nematode worm Caenorhabdi...