Nicanor Carrasco-Vargas

activity

20232026

Z

, the subgroup membership problem, and Medvedev degrees of effective subshifts

2 citations · 3 across the 12 of their papers we have counts for

collaborators

Showing math.COShow all

1 paper · 1 filter

math.CO2023★ 1 cited

Infinite Eulerian paths are computable on graphs with vertices of infinite degree

Nicanor Carrasco-Vargas

The Erdős, Grünwald, and Weiszfeld theorem is a characterization of those infinite graphs which are Eulerian. That is, infinite graphs that admit infinite Eulerian paths. In this a…