A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications

2003
*
Theoretical Computer Science
*

We consider the class US k of uniformly k-sparse simple graphs, i.e., the class of ÿnite or countable simple graphs, every ÿnite subgraph of which has a number of edges bounded by k times the number of vertices. We prove that for each k, every monadic second-order formula (intended to express a graph property) that uses variables denoting sets of edges can be e ectively translated into a monadic second-order formula where all set variables denote sets of vertices and that expresses the same

doi:10.1016/s0304-3975(02)00578-9
fatcat:4aozazrqarbvpmald6ifup3mxm