Covering a symmetric poset by symmetric chains

DOI10.1007/BF01215916zbMath0902.06001MaRDI QIDQ1272179

Tamás Fleiner

Publication date: 23 November 1998

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

partially ordered setsmin-max theoremedge cover of a graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorics of partially ordered sets (06A07)

Related Items

On the feedback vertex set polytope of a series-parallel graph

Cites Work

• A decomposition theorem for partially ordered sets
• Paths, Trees, and Flowers