307,172 research outputs found
Recommended from our members
The universality of polynomial time Turing equivalence
We show that polynomial time Turing equivalence and a large class of other equivalence relations from computational complexity theory are universal countable Borel equivalence relations. We then discuss ultrafilters on the invariant Borel sets of these equivalence relations which are related to Martin's ultrafilter on the Turing degrees
On graph equivalences preserved under extensions
Let R be an equivalence relation on graphs. By the strengthening of R we mean
the relation R' such that graphs G and H are in the relation R' if for every
graph F, the union of the graphs G and F is in the relation R with the union of
the graphs H and F. We study strengthenings of equivalence relations on graphs.
The most important case that we consider concerns equivalence relations defined
by graph properties. We obtain results on the strengthening of equivalence
relations determined by the properties such as being a k-connected graph,
k-colorable, hamiltonian and planar
- …