Abstract
We classify graphs and, more generally, finite relational structures that are identified by \({C^{2}}\), that is, two-variable first-order logic with counting. Using this classification, we show that it can be decided in almost linear time whether a structure is identified by \({C^{2}}\). Our classification implies that for every graph identified by this logic, all vertex-colored versions of it are also identified. A similar statement is true for finite relational structures.
We provide constructions that solve the inversion problem for finite structures in linear time. This problem has previously been shown to be polynomial time solvable by Martin Otto. For graphs, we conclude that every \({C^{2}}\)-equivalence class contains a graph whose orbits are exactly the classes of the \({C^{2}}\)-partition of its vertex set and which has a single automorphism witnessing this fact.
For general k, we show that such statements are not true by providing examples of graphs of size linear in k which are identified by \({C^{3}}\) but for which the orbit partition is strictly finer than the \(C^k\)-partition. We also provide identified graphs which have vertex-colored versions that are not identified by \(C^k\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Arvind, V., Köbler, J., Rattan, G., Verbitsky, O.: On the power of color refinement. In: FCT 2015, (to appear 2015)
Atserias, A., Maneva, E.N.: Sherali-adams relaxations and indistinguishability in counting logics. SIAM J. Comput. 42(1), 112–137 (2013)
Babai, L., Erdös, P., Selkow, S.M.: Random graph isomorphism. SIAM J. Comput. 9(3), 628–635 (1980)
Babai, L., Kucera, L.: Canonical labelling of graphs in linear average time. In: FOCS 1979, pp. 39–46. IEEE Computer Society (1979)
Berkholz, C., Bonsma, P., Grohe, M.: Tight lower and upper bounds for the complexity of canonical colour refinement. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 145–156. Springer, Heidelberg (2013)
Cai, J., Fürer, M., Immerman, N.: An optimal lower bound on the number of variables for graph identifications. Combinatorica 12(4), 389–410 (1992)
Chang, L.-C.: The uniqueness and nonuniqueness of the triangular association scheme. Sci. Record. 3, 604–613 (1959)
Dawar, A., Holm, B.: Pebble games with algebraic rules. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol. 7392, pp. 251–262. Springer, Heidelberg (2012)
Grädel, E., Otto, M.: On logics with two variables. Theor. Comput. Sci. 224(1–2), 73–113 (1999)
Grädel, E., Otto, M., Rosen, E.: Two-variable logic with counting is decidable. In: LICS 1997, pp. 306–317. IEEE Computer Society (1997)
Grohe, M.: Finite variable logics in descriptive complexity theory. Bull. Symbolic Log. 4(4), 345–398 (1998)
Grohe, M., Otto, M.: Pebble games and linear equations. In: Cégielski, P., Durand, A. (eds.) CSL 2012, of LIPIcs, vol. 16, pp. 289–304 (2012)
Hella, L.: Logical hierarchies in PTIME. Inf. Comput. 129(1), 1–19 (1996)
Hoffman, A.J.: On the uniqueness of the triangular association scheme. Ann. Math. Statist. 31(2), 492–497 (1960)
Kiefer, S., Schweitzer, P., Selman, E.: Graphs identified by logics with counting. CoRR, abs/1503.08792 (2015). full version of the paper
Kopczynski, E., Tan, T.: Regular graphs and the spectra of two-variable logic with counting. CoRR, abs/1304.0829 (2013)
Krebs, A., Verbitsky, O.: Universal covers, color refinement, and two-variable logic with counting quantifiers: Lower bounds for the depth. CoRR, abs/1407.3175 (2014)
Kucera, L.: Canonical labeling of regular graphs in linear average time. In: FOCS 1987, pp. 271–279. IEEE Computer Society (1987)
Lucas, E.: Récréations mathématiques. 2ième éd., nouveau tirage. Librairie Scientifique et Technique Albert Blanchard, Paris (1960)
McKay, B.D., Piperno, A.: Practical graph isomorphism, II. J. Symb. Comput. 60, 94–112 (2014)
Otto, M.: Canonization for two variables and puzzles on the square. Ann. Pure Appl. Logic 85(3), 243–282 (1997)
Pratt-Hartmann, I.: Complexity of the two-variable fragment with counting quantifiers. J. Log. Lang. Inf. 14(3), 369–395 (2005)
West, D.B.: Introduction to Graph Theory, 2nd edn. Pearson, Upper Saddle River (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kiefer, S., Schweitzer, P., Selman, E. (2015). Graphs Identified by Logics with Counting. In: Italiano, G., Pighizzini, G., Sannella, D. (eds) Mathematical Foundations of Computer Science 2015. MFCS 2015. Lecture Notes in Computer Science(), vol 9234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48057-1_25
Download citation
DOI: https://doi.org/10.1007/978-3-662-48057-1_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48056-4
Online ISBN: 978-3-662-48057-1
eBook Packages: Computer ScienceComputer Science (R0)