DM
2002
13 years 11 months ago
2002
The well-known theorem by Gallai
JGT
2007
13 years 11 months ago
2007
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...
DM
2006
13 years 11 months ago
2006
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...
CONCUR
2008
Springer
14 years 1 months ago
2008
Springer
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 ...