In the following paper the author's claim that almost all graphs can be expressed in first order logic with counting quantifiers and two variables.

I would like to know, is there any algorithm that infers a C$^2$ representation of a graph ?

If there is then what is its time complexity ?



Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.