Cut-sets in infinite graphs and partial orders

DOI10.1016/0012-365X(93)90328-QzbMATH Open0781.06005MaRDI QIDQ686154FDOQ686154

Norbert Sauer, Andras Hajnal

Publication date: 1 November 1993

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

zbMATH Keywords

boundsinfinite graphchaininfinite posetmaximal cliquecomparability graphindependent 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

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

Cited In (3)

• Title not available (Why is that?)
• The PT-order, minimal cutsets and Menger property
• Extensions of ordered sets having the finite cutset property

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Finite cutsets and finite antichains 👍 👎
• Title not available (Why is that?) 👍 👎
• Wide posets with fixed height and cutset number 👍 👎

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)