Width two posets are reconstructible
D Kratsch, JX Rampon - Discrete Mathematics, 1996 - Elsevier
D Kratsch, JX Rampon
Discrete Mathematics, 1996•Elsevier… In this note we provide a new step towards a positive answer to Ulam's reconstruction
conjecture for posets giving a constructive proof that width two posets are reconstructible.
We recall that the width of a poset P is the maximum size of an antichain (ie a set of pairwise
incomparable elements) in P. Our reconstruction terminology follows the one of the graph
reconstruction problem as stated in [… Our approach cannot be used for showing that width
3 posets are reconstructible since the given proof that width two posets are reconstructible …
conjecture for posets giving a constructive proof that width two posets are reconstructible.
We recall that the width of a poset P is the maximum size of an antichain (ie a set of pairwise
incomparable elements) in P. Our reconstruction terminology follows the one of the graph
reconstruction problem as stated in [… Our approach cannot be used for showing that width
3 posets are reconstructible since the given proof that width two posets are reconstructible …
In this note we are dealing with Ulam's reconstruction conjecture applied to finite partially ordered sets. We provide a new step towards a positive answer giving a constructive proof that width two posets are reconstructible.
Elsevier
Showing the best result for this search. See all results