The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3

We prove that the Weisfeiler--Leman (WL) dimension of the class of all finite planar graphs is at most 3. In particular, every finite planar graph is definable in first-order logic with counting using at most 4 variables. The previously best-known upper bounds for the dimension and number of variables were 14 and 15, respectively. First, we show that, for dimension 3 and higher, the WL-algorithm correctly tests isomorphism of graphs in a minor-closed class whenever it determines the orbits of the automorphism group of every arc-colored 3-connected graph belonging to this class. Then, we prove that, apart from several exceptional graphs (which have WL-dimension at most 2), the individualization of two appropriately chosen vertices of a colored 3-connected planar graph followed by the one-dimensional WL-algorithm produces the discrete vertex partition. This implies that the three-dimensional WL-algorithm determines the orbits of arc-colored 3-connected planar graphs. As a byproduct of the proof, we get a classification of the 3-connected planar graphs with fixing number 3.

[1]  I. Ponomarenko.  The isomorphism problem for classes of graphs closed under contraction , 1991 .

[2]  Albert Atserias,et al.  Sherali-Adams relaxations and indistinguishability in counting logics , 2012, ITCS '12.

[3]  Carsten Thomassen,et al.  Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.

[4]  Jenish C. Mehta.  Dynamic Complexity of Planar 3-Connected Graph Isomorphism , 2014, CSR.

[5]  Martin Grohe,et al.  Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[6]  Brendan D. McKay,et al.  Practical graph isomorphism, II , 2013, J. Symb. Comput..

[7]  Martin Grohe,et al.  PEBBLE GAMES AND LINEAR EQUATIONS , 2012, The Journal of Symbolic Logic.

[8]  D. V. Karpov,et al.  On the Structure of a k-Connected Graph , 2003 .

[9]  Oleg Verbitsky,et al.  Testing Graph Isomorphism in Parallel by Playing a Game , 2006, ICALP.

[10]  Robert E. Tarjan,et al.  A V log V Algorithm for Isomorphism of Triconnected Planar Graphs , 1973, J. Comput. Syst. Sci..

[11]  Sergei Evdokimov,et al.  Separability Number and Schurity Number of Coherent Configurations , 2000, Electron. J. Comb..

[12]  Pascal Schweitzer,et al.  Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[13]  Martin Grohe,et al.  Descriptive Complexity, Canonisation, and Definable Graph Structure Theory , 2017, Lecture Notes in Logic.

[14]  Martin Grohe,et al.  Isomorphism testing for embeddable graphs through definability , 2000, STOC '00.

[15]  Martin Grohe,et al.  Definability and Descriptive Complexity on Databases of Bounded Tree-Width , 1999, ICDT.

[16]  Robert E. Tarjan,et al.  Isomorphism of Planar Graphs , 1972, Complexity of Computer Computations.

[17]  John E. Hopcroft,et al.  Linear time algorithm for isomorphism of planar graphs (Preliminary Report) , 1974, STOC '74.

[18]  B. Weisfeiler.  On construction and identification of graphs , 1976 .

[19]  Christoph Berkholz,et al.  Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler–Leman Refinement Steps , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[20]  Martin Grohe,et al.  Fixed-point logics on planar graphs , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[21]  Nutan Limaye,et al.  Planar Graph Isomorphism is in Log-Space , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

[22]  Neil Immerman,et al.  An optimal lower bound on the number of variables for graph identification , 1992, Comb..

[23]  Oleg Verbitsky,et al.  On the Power of Color Refinement , 2015, FCT.

[24]  Martin Grohe,et al.  Tangled up in Blue (A Survey on Connectivity, Decompositions, and Tangles) , 2016, ArXiv.

[25]  Robert E. Tarjan,et al.  A V² Algorithm for Determining Isomorphism of Planar Graphs , 1971, Inf. Process. Lett..

[26]  Oleg Verbitsky,et al.  Planar Graphs: Logical Complexity and Parallel Isomorphism Tests , 2006, STACS.

[27]  Jacobo Torán,et al.  The Graph Isomorphism Problem (Dagstuhl Seminar 15511) , 2015, Dagstuhl Reports.

[28]  Brendan D. McKay,et al.  Recursive generation of simple planar 5-regular graphs and pentangulations , 2011, J. Graph Algorithms Appl..

[29]  W. T. Tutte.  How to Draw a Graph , 1963 .

[30]  Pascal Schweitzer,et al.  Graphs Identified by Logics with Counting , 2015, MFCS.