Cut-sets in infinite graphs and partial orders

DOI10.1016/0012-365X(93)90328-QzbMath0781.06005MaRDI QIDQ686154

Norbert W. Sauer, Andras Hajnal

Publication date: 1 November 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

boundscomparability graphinfinite graphchainmaximal cliqueinfinite posetindependent set of verticesmaximal antichaincut-set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorics of partially ordered sets (06A07) Other combinatorial set theory (03E05)

Cites Work

• Finite cutsets and finite antichains
• The length, the width and the cutset-number of finite ordered sets
• A chain decomposition theorem
• Combinatorial set theory
• A decomposition theorem for partially ordered sets
• Compact Spaces and Spaces of Maximal Complete Subgraphs
• Antichains and Finite Sets that Meet all Maximal Chains