Cut-sets in infinite graphs and partial orders

DOI10.1016/0012-365X(93)90328-QMaRDI QIDQ686154zbMATH OpenFDO

Authors Andras Hajnal, Norbert Sauer

Publication date 1 November 1993

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(93)90328-Q

zbMATH Keywords

boundschaincomparability graphcut-setindependent set of verticesinfinite graphinfinite posetmaximal antichainmaximal clique

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1153451
• scientific article; zbMATH DE number 4023345
• Finite cutsets and finite antichains
• scientific article; zbMATH DE number 3957179
• Wide posets with fixed height and cutset number

Cites work

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

Cited in

(3)

• Extensions of ordered sets having the finite cutset property
• scientific article; zbMATH DE number 15459 (Why is no real title available?)
• The PT-order, minimal cutsets and Menger property

This page was built for publication: Cut-sets in infinite graphs and partial orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686154)