BIROn - Birkbeck Institutional Research Online

    Characterising bounded expansion by neighbourhood complexity

    Reidl, Felix and Sánchez Villaamil, F. and Stavropoulos, K. (2018) Characterising bounded expansion by neighbourhood complexity. Characterising bounded expansion by neighbourhood complexity 75 , pp. 152-168. ISSN 0195-6698.

    [img]
    Preview
    Text
    EURCOMB18.pdf - Author's Accepted Manuscript
    Available under License Creative Commons Attribution Non-commercial No Derivatives.

    Download (579kB) | Preview

    Abstract

    We show that a graph class $\cal G$ has \emph{bounded expansion} if and only if it has bounded \emph{$r$-neighbourhood complexity}, \ie for any vertex set $X$ of any subgraph~$H$ of any $G\in\cal G$, the number of subsets of $X$ which are exact $r$-neighbourhoods of vertices of $H$ on $X$ is linear in the size of $X$. This is established by bounding the $r$-neighbourhood complexity of a graph in terms of both its \emph{$r$-centred colouring number} and its \emph{weak $r$-colouring number}, which provide known characterisations to the property of bounded expansion.

    Metadata

    Item Type: Article
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Felix Reidl
    Date Deposited: 26 Oct 2018 07:04
    Last Modified: 26 Sep 2019 18:25
    URI: http://eprints.bbk.ac.uk/id/eprint/24753

    Statistics

    Downloads
    Activity Overview
    19Downloads
    30Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item