Combinatorial theorems on contractive mappings in power sets

DOI10.1016/0012-365X(82)90120-0zbMath0486.05007OpenAlexW2041401009MaRDI QIDQ1164629

Egbert Harzheim

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0012-365x(82)90120-0

zbMATH Keywords

increasing sequence of subsetssubtrees in power sets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (5)

Regressions and monotone chains. II: the poset of integer intervals ⋮ A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies ⋮ A constructive proof for a theorem on contractive mappings in power sets ⋮ Combinatorial properties of regressive mappings ⋮ Regressions and monotone chains: A Ramsey-type extremal problem for partial orders

Cites Work

• Unnamed Item
• Unnamed Item
• A Theorem on Chains of Finite Sets
• On Finite Nests of Intervals of Integers
• Representatives of subsets
• Ein Satz der kombinatorischen Mengenlehre
• Kombinatorische Betrachtungen über die Struktur der Potenzmenge
• A theorem on chains of finite sets, II
• Another Proof of a Result of Perry on Chains of Finite Sets
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: Combinatorial theorems on contractive mappings in power sets