2019 International Conference on Data Mining Workshops (ICDMW)
Download PDF

Abstract

It is shown that Omega (n) variables are needed for first-order logic with counting to identify graphs on n vertices. This settles a long-standing open problem. The lower bound remains true over a set of graphs of color class size 4. This contrasts sharply with the fact that three variables suffice to identify all graphs of color class size 3, and two variables suffice to identify almost all graphs. The lower bound is optimal up to multiplication by a constant because n variables obviously suffice to identify graphs on n vertices.
Like what you’re reading?
Already a member?
Get this article FREE with a new membership!

Similar Articles