Implicit Representations and Factorial Properties of Graphs
Aistis Atminas, Andrew Collins, Vadim Lozin, Victor Zamaraev

TL;DR
This paper explores implicit graph representations, introduces tools to identify classes with factorial growth, and demonstrates many such classes admit implicit representations, advancing understanding of graph encoding complexity.
Contribution
The paper introduces new tools to determine when hereditary graph classes have factorial growth and proves many such classes admit implicit representations, advancing the implicit graph conjecture.
Findings
Identified new hereditary classes with factorial growth.
Many classes with factorial growth admit implicit representations.
Provided tools to analyze the growth and representation of graph classes.
Abstract
The idea of implicit representation of graphs was introduced in [S. Kannan, M. Naor, S. Rudich, Implicit representation of graphs, SIAM J. Discrete Mathematics, 5 (1992) 596--603] and can be defined as follows. A representation of an -vertex graph is said to be implicit if it assigns to each vertex of a binary code of length so that the adjacency of two vertices is a function of their codes. Since an implicit representation of an -vertex graph uses bits, any class of graphs admitting such a representation contains labelled graphs with vertices. In the terminology of [J. Balogh, B. Bollob\'{a}s, D. Weinreich, The speed of hereditary properties of graphs, J. Combin. Theory B 79 (2000) 131--156] such classes have at most factorial speed of growth. In this terminology, the implicit graph conjecture can be stated as follows: every…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · graph theory and CDMA systems · Limits and Structures in Graph Theory
