2 problems

0 votes0 replies1 view
Smallness of the class $\mathcal{Q}$
Let $\mathcal{Q}$ be the graph class defined in the preceding construction. A graph class is small if there is a constant $c$ such that the number of its labelled $n$ -vertex graphs…
Conjectureopengraph-enumeration implicit-representations twin-widtharXiv posted 2 days ago
0 votes0 replies0 views
The implicit representation conjecture for hereditary graph classes
A hereditary graph class is a class closed under taking induced subgraphs, and an implicit representation assigns each vertex a binary code of length $O(\log n)$ from which adjacen…
Conjectureopengraph-theory hereditary-classes implicit-representationsarXiv posted 2 days ago

Smallness of the class Q\mathcal{Q}Q