The Implicit Graph Conjecture is False

An efficient implicit representation of an n-vertex graph G in a family F of graphs assigns to each vertex of G a binary code of length O(log n) so that the adjacency between every pair of vertices can be determined only as a function of their codes. This function can depend on the family but not on the individual graph. Every family of graphs admitting such a representation contains at most 2 log(n)) graphs on n vertices, and thus has at most factorial speed of growth. The Implicit Graph Conjecture states that, conversely, every hereditary graph family with at most factorial speed of growth admits an efficient implicit representation. We refute this conjecture by establishing the existence of hereditary graph families with factorial speed of growth that require codes of length n.

[1]  R. Graham,et al.  On graphs which contain all sparse graphs , 1982 .

[2]  Marthe Bonamy,et al.  Optimal labelling schemes for adjacency, comparability, and reachability , 2020, STOC.

[3]  Béla Bollobás,et al.  Graphs which Contain all Small Graphs , 1981, Eur. J. Comb..

[4]  J. Moon,et al.  On minimal n-universal graphs , 1965, Proceedings of the Glasgow Mathematical Association.

[5]  Colin McDiarmid,et al.  Integer realizations of disk and segment graphs , 2011, J. Comb. Theory, Ser. B.

[6]  Pooya Hatami,et al.  A counter-example to the probabilistic universal graph conjecture via randomized communication complexity , 2021, Discret. Appl. Math..

[7]  Ronald L. Graham,et al.  ON UNIVERSAL GRAPHS , 1979 .

[8]  Pierre Fraigniaud,et al.  An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets , 2016, J. ACM.

[9]  Stephen Alstrup,et al.  Small induced-universal graphs and compact implicit graph representations , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[10]  Arnold L. Rosenberg,et al.  Universal Graphs for Bounded-Degree Trees and Planar Graphs , 1989, SIAM J. Discret. Math..

[11]  Cyril Gavoille,et al.  Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs , 2007, ESA.

[12]  Fan Chung Graham,et al.  On graphs which contain all small trees , 1978, J. Comb. Theory, Ser. B.

[13]  Béla Bollobás,et al.  The Speed of Hereditary Properties of Graphs , 2000, J. Comb. Theory B.

[14]  John Harold Muller,et al.  Local structure in graph classes , 1988 .

[15]  Mathias Bæk Tejs Knudsen,et al.  Optimal Induced Universal Graphs and Adjacency Labeling for Trees , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[16]  Sebastian Wild,et al.  Randomized Communication and the Implicit Graph Conjecture , 2021, ArXiv.

[17]  Cyril Gavoille,et al.  Adjacency Labelling for Planar Graphs (and Beyond) , 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

[18]  Noga Alon,et al.  Asymptotically optimal induced universal graphs , 2017 .

[19]  Pooya Hatami,et al.  Dimension-free bounds and structural results in communication complexity , 2022, Israel Journal of Mathematics.

[20]  Vadim V. Lozin,et al.  Implicit representations and factorial properties of graphs , 2014, Discret. Math..

[21]  Moni Naor,et al.  Implicit representation of graphs , 1992, STOC '88.

[22]  Rémi Watrigant,et al.  Twin-width II: small classes , 2020, SODA.

[23]  Angela Y. Wu,et al.  Embedding of tree networks into hypercubes , 1985, J. Parallel Distributed Comput..

[24]  Mikkel Thorup,et al.  Adjacency Labeling Schemes and Induced-Universal Graphs , 2014, STOC.

[25]  Edward R. Scheinerman.  Local representations using very short labels , 1999, Discret. Math..

[26]  R. Rado.  Universal graphs and universal functions , 1964 .