The poset on connected induced subgraphs of a graph need not be Sperner
From MaRDI portal
Publication:1904390
DOI10.1007/BF01111746zbMath0835.06002MaRDI QIDQ1904390
Steve Seif, André E. Kézdy, Michael S. Jacobson
Publication date: 20 December 1995
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01111746
Related Items
Unnamed Item, Greedy trees, subtrees and antichains, The poset of unlabeled induced subgraphs of a finite graph, The poset on connected graphs is Sperner, Infinitely many trees have non-Sperner subtree poset
Cites Work