The poset of graphs ordered by induced containment
Combinatorics
2018-06-18 v2
Abstract
We study the poset of all unlabelled graphs, up to isomorphism, with if occurs as an induced subgraph in . We present some general results on the M\"obius function of intervals of and some results for specific classes of graphs. This includes a case where the M\"obius 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\"obius function is unbounded. A classification of the disconnected intervals of is presented, which gives a large class of non-shellable intervals. We also present several conjectures on the structure of .
Keywords
Cite
@article{arxiv.1806.01821,
title = {The poset of graphs ordered by induced containment},
author = {Jason P. Smith},
journal= {arXiv preprint arXiv:1806.01821},
year = {2018}
}
Comments
24 pages