Computer Science – Discrete Mathematics
Scientific paper
2009-03-12
European Journal of Combinatorics (2009) 1-7
Computer Science
Discrete Mathematics
Scientific paper
10.1016/j.ejc.2009.09.004
In a recent paper, Amini et al. introduce a general framework to prove duality theorems between special decompositions and their dual combinatorial object. They thus unify all known ad-hoc proofs in one single theorem. While this unification process is definitely good, their main theorem remains quite technical and does not give a real insight of why some decompositions admit dual objects and why others do not. The goal of this paper is both to generalise a little this framework and to give an enlightening simple proof of its central theorem.
Lyaudet Laurent
Mazoit Frédéric
Thomassé Stéphan
No associations
LandOfFree
Partitions versus sets : a case of duality does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Partitions versus sets : a case of duality, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Partitions versus sets : a case of duality will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-35968