The poset on connected induced subgraphs of a graph need not be Sperner

DOI10.1007/BF01111746zbMath0835.06002OpenAlexW2043922447MaRDI 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

zbMATH Keywords

treedistributive latticeinduced subgraphunimodalSperner latticeSperner poset

Mathematics Subject Classification ID

Partial orders, general (06A06) Graph theory (05C99)

Related Items (5)

The poset on connected graphs is Sperner ⋮ Greedy trees, subtrees and antichains ⋮ Infinitely many trees have non-Sperner subtree poset ⋮ The poset of unlabeled induced subgraphs of a finite graph ⋮ Unnamed Item

Cites Work

• Some theorems on graphs and posets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The poset on connected induced subgraphs of a graph need not be Sperner