Abstract
In this article, we show that there exists a graph G with O ( n ) nodes such that any forest of n nodes is an induced subgraph of G . Furthermore, for constant arboricity k , the result implies the existence of a graph with O ( n k ) nodes that contains all n -node graphs of arboricity k as node-induced subgraphs, matching a Ω ( n k ) lower bound of Alstrup and Rauhe. Our upper bounds are obtained through a log 2 n + O (1) labeling scheme for adjacency queries in forests. We hereby solve an open problem being raised repeatedly over decades by authors such as Kannan et al., Chung, and Fraigniaud and Korman.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
