The poset of graphs ordered by induced containment

Smith, Jason P. (2019) The poset of graphs ordered by induced containment. Journal of Combinatorial Theory. Series A, 168. pp. 348-373. ISSN 0097-3165

[img] Text (Smith-JCT-2019-The-poset-of-graphs-ordered-by-induced-containment)
Smith_JCT_2019_The_poset_of_graphs_ordered_by_induced_containment.pdf
Accepted Author Manuscript
Restricted to Repository staff only until 4 July 2020.
License: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 logo

Download (256kB) | Request a copy from the Strathclyde author

    Abstract

    We study the poset G of all unlabelled graphs with H≤G if H occurs as an induced subgraph in G. We present some general results on the Möbius function of intervals of G and some results for specific classes of graphs. This includes a case where the Möbius function is given by the Catalan numbers, which we prove using discrete Morse theory, and another case where it equals the Fibonacci numbers, therefore showing that the Möbius function is unbounded. A classification of the disconnected intervals of G is presented, which gives a large class of non-shellable intervals. We also present several conjectures on the structure of G.