On the public citation graph

A proof of dilworth’s decomposition theorem for partially ordered sets

https://doi.org/10.1007/bf02759805
0 signed · 91 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_10openalex-snapshot
A Decomposition Theorem for Partially Ordered Sets
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_11openalex-snapshot
The Marriage Problem*
inferredcites →https://doi.org/10.1007/bf01792729openalex-snapshot
Theorie der endlichen und unendlichen Graphen
inferredcites →https://doi.org/10.1016/s1385-7258(51)50053-7openalex-snapshot
A Colour Problem for Infinite Graphs and a Problem in the Theory of Relations
inferredcites →https://doi.org/10.1090/s0002-9939-1951-0040376-xopenalex-snapshot
Choice Functions and Tychonoff's Theorem
inferredcites →https://doi.org/10.1090/s0002-9939-1956-0078334-6openalex-snapshot
Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
inferredcites →https://doi.org/10.1515/9781400881987-012openalex-snapshot
11. Dilworth’s Theorem on Partially Ordered Sets
inferredcites →https://doi.org/10.2307/1969503openalex-snapshot
A Decomposition Theorem for Partially Ordered Sets
inferredcites →https://doi.org/10.2307/2372148openalex-snapshot
The Marriage Problem
inferredcites →https://doi.org/10.4153/cjm-1949-031-1openalex-snapshot
Axiomatic Treatment of Rank in Infinite Sets

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/malq.19750210126openalex-snapshot
Der Satz von Dilworth und Souslin's Hypothese
inferred← citeshttps://doi.org/10.1002/mana.19690390411openalex-snapshot
On n‐connected graphs
inferred← citeshttps://doi.org/10.1006/jeth.2001.2814openalex-snapshot
Utility Representation of an Incomplete Preference Relation
inferred← citeshttps://doi.org/10.1007/978-1-4899-3558-8_3openalex-snapshot
The Impact of the Chain Decomposition Theorem on Classical Combinatorics
inferred← citeshttps://doi.org/10.1007/978-1-4899-3558-8_4openalex-snapshot
Dilworth’s Decomposition Theorem in the Infinite Case
inferred← citeshttps://doi.org/10.1007/978-3-030-30229-0_2openalex-snapshot
On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
inferred← citeshttps://doi.org/10.1007/978-3-642-38206-2openalex-snapshot
Lefschetz Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-38206-2_1openalex-snapshot
Poset Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-38206-2_2openalex-snapshot
Basics on the Theory of Local Rings
inferred← citeshttps://doi.org/10.1007/978-3-642-38206-2_4openalex-snapshot
Complete Intersections with the SLP
inferred← citeshttps://doi.org/10.1007/978-3-642-38206-2_5openalex-snapshot
A Generalization of Lefschetz Elements
inferred← citeshttps://doi.org/10.1007/978-3-642-38206-2_6openalex-snapshot
k-Lefschetz Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-38206-2_7openalex-snapshot
Cohomology Rings and the Strong Lefschetz Property
inferred← citeshttps://doi.org/10.1007/978-3-642-38206-2_8openalex-snapshot
Invariant Theory and Lefschetz Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-38206-2_9openalex-snapshot
The Strong Lefschetz Property and the Schur–Weyl Duality
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_68openalex-snapshot
Feasible Combinatorial Matrix Theory
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_8openalex-snapshot
Parameters of Partial Orders and Graphs: Packing, Covering, and Representation
inferred← citeshttps://doi.org/10.1007/978-94-009-7798-3_16openalex-snapshot
Extremal Problems in Partially Ordered Sets
inferred← citeshttps://doi.org/10.1007/978-94-009-7798-3_8openalex-snapshot
On the Cofinality of Partially Ordered Sets
inferred← citeshttps://doi.org/10.1007/978-981-96-0069-4_3openalex-snapshot
Sets and Relations
inferred← citeshttps://doi.org/10.1007/bf00337691openalex-snapshot
A note on Dilworth's theorem in the infinite case
inferred← citeshttps://doi.org/10.1007/bf00340779openalex-snapshot
Some inequalities for partial orders
inferred← citeshttps://doi.org/10.1007/bf01297705openalex-snapshot
A proof of Menger's theorem
inferred← citeshttps://doi.org/10.1007/bf02302408openalex-snapshot
Test groups and effect algebras
inferred← citeshttps://doi.org/10.1007/bf02759806openalex-snapshot
On dilworth’s theorem in the in finite case
inferred← citeshttps://doi.org/10.1007/s10474-019-00967-wopenalex-snapshot
Dilworth's decomposition theorem for posets in ZF
inferred← citeshttps://doi.org/10.1007/s11083-015-9355-yopenalex-snapshot
Dimension and Matchings in Comparability and Incomparability Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(79)90157-2openalex-snapshot
Another proof of dilworth's decomposition theorem
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90328-yopenalex-snapshot
Gallai-Milgram properties for infinite graphs
inferred← citeshttps://doi.org/10.1016/0022-247x(66)90106-5openalex-snapshot
Systems of representatives
inferred← citeshttps://doi.org/10.1016/0166-218x(87)90065-5openalex-snapshot
Two easy duality theorems for product partial orders
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50010-5openalex-snapshot
10.1016/b978-044488002-4/50010-5
inferred← citeshttps://doi.org/10.1016/j.dam.2024.08.014openalex-snapshot
On locally finite ordered rooted trees and their rooted subtrees
inferred← citeshttps://doi.org/10.1016/s0021-9800(67)80079-6openalex-snapshot
On Dilworth's decomposition theorem for partially ordered sets
inferred← citeshttps://doi.org/10.1016/s0021-9800(70)80059-xopenalex-snapshot
Decomposing partial orderings into chains
inferred← citeshttps://doi.org/10.1016/s0049-237x(00)80062-2openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70979-0openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80049-9openalex-snapshot
Chapter 16 A survey of recursive combinatorics
inferred← citeshttps://doi.org/10.1016/s0076-5392(08)63140-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1017/9781108568708openalex-snapshot
An Invitation to Combinatorics
inferred← citeshttps://doi.org/10.1017/9781108568708.001openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1017/9781108568708.002openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1017/9781108568708.003openalex-snapshot
Induction and Recurrence Relations
inferred← citeshttps://doi.org/10.1017/9781108568708.004openalex-snapshot
The Pigeonhole Principle and Ramsey Theory
inferred← citeshttps://doi.org/10.1017/9781108568708.005openalex-snapshot
Counting, Probability, Balls and Boxes
inferred← citeshttps://doi.org/10.1017/9781108568708.006openalex-snapshot
Permutations and Combinations
inferred← citeshttps://doi.org/10.1017/9781108568708.007openalex-snapshot
Binomial and Multinomial Coefficients
inferred← citeshttps://doi.org/10.1017/9781108568708.008openalex-snapshot
Stirling Numbers
inferred← citeshttps://doi.org/10.1017/9781108568708.009openalex-snapshot
Integer Partitions
inferred← citeshttps://doi.org/10.1017/9781108568708.010openalex-snapshot
The Inclusion–Exclusion Principle
inferred← citeshttps://doi.org/10.1017/9781108568708.011openalex-snapshot
Generating Functions
inferred← citeshttps://doi.org/10.1017/9781108568708.012openalex-snapshot
Graph Theory
inferred← citeshttps://doi.org/10.1017/9781108568708.013openalex-snapshot
Posets, Matchings, and Boolean Lattices
inferred← citeshttps://doi.org/10.1017/9781108568708.014openalex-snapshot
Short Answers for Warm-Up Problems
inferred← citeshttps://doi.org/10.1017/9781108568708.015openalex-snapshot
Hints for Selected Problems
inferred← citeshttps://doi.org/10.1017/9781108568708.016openalex-snapshot
Short Answers for Selected Problems
inferred← citeshttps://doi.org/10.1017/9781108568708.017openalex-snapshot
Complete Solutions for Selected Problems
inferred← citeshttps://doi.org/10.1017/9781108568708.018openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1017/9781108568708.019openalex-snapshot
Index
inferred← citeshttps://doi.org/10.1017/9781108568708.020openalex-snapshot
Plate Section
inferred← citeshttps://doi.org/10.1017/cbo9781139164931.029openalex-snapshot
Hints for Selected Problems
inferred← citeshttps://doi.org/10.1017/s0017089500003931openalex-snapshot
Remarks on Dilworth's theorem in relation to transversal theory
inferred← citeshttps://doi.org/10.1023/a:1016541101728openalex-snapshot
Obstacles to Extending Mirsky's Theorem
inferred← citeshttps://doi.org/10.1080/00029890.1994.11996954openalex-snapshot
A Proof of Dilworth's Chain Decomposition Theorem
inferred← citeshttps://doi.org/10.1080/07468342.1989.11973218openalex-snapshot
On-Line Partitioning of Partially Ordered Sets
inferred← citeshttps://doi.org/10.1090/s0002-9939-1975-0373988-0openalex-snapshot
A Note on Dilworth's Embedding Theorem
inferred← citeshttps://doi.org/10.1090/s0002-9947-1981-0628446-xopenalex-snapshot
An Effective Version of Dilworth's Theorem
inferred← citeshttps://doi.org/10.1109/bdcloud.2014.118openalex-snapshot
On the Graph Decomposition
inferred← citeshttps://doi.org/10.1109/csss.2012.41openalex-snapshot
On the Decomposition of Posets
inferred← citeshttps://doi.org/10.1109/focs.2010.40openalex-snapshot
The Sub-exponential Upper Bound for On-Line Chain Partitioning
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb16439.xopenalex-snapshot
Some Condensations in Posets and Graphs and Their Applications
inferred← citeshttps://doi.org/10.1137/0117056openalex-snapshot
Combinatorial Configurations
inferred← citeshttps://doi.org/10.1155/2013/692645openalex-snapshot
Another Note on Dilworth's Decomposition Theorem
inferred← citeshttps://doi.org/10.1155/s0161171203210395openalex-snapshot
Archimedean unital groups with finite unit intervals
inferred← citeshttps://doi.org/10.2478/v10037-009-0028-4openalex-snapshot
Dilworth's Decomposition Theorem for Posets
inferred← citeshttps://doi.org/10.29007/r7fgopenalex-snapshot
Formalization of some central theorems in combinatorics of finite sets
inferred← citeshttps://doi.org/10.2991/iccnce.2013.31openalex-snapshot
On the Decomposition of Posets into Minimum Set Node-Disjoint Chains
inferred← citeshttps://doi.org/10.48550/arxiv.1303.6453openalex-snapshot
Feasible combinatorial matrix theory
inferred← citeshttps://doi.org/10.48550/arxiv.1804.01567openalex-snapshot
On-line Chain Partitioning Approach to Scheduling
inferred← citeshttps://doi.org/10.71548/19049openalex-snapshot
Formalizing Combinatorial Matrix Theory
inferred← citeshttps://doi.org/10.9734/bjmcs/2015/19380openalex-snapshot
On the DAG Decomposition
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.