A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
A prototype of zero-sum theorems, the well-known theorem of Erdos, Ginzburg and Ziv says that for any positive integer n, any sequence a1, a2, . . . , a2n-1 of 2n-1 integers has a...
Sukumar Das Adhikari, Yong-Gao Chen, John Friedlan...
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
Jos C. M. Baeten, Pieter J. L. Cuijpers, P. J. A. ...