Related papers: Heterochromatic tree partition number of a complet…

This paper has been withdrawn by the author due to errors.

This paper has been withdrawn by the authors; the main conclusion is incorrect, as some of the crucial calculations were not properly converged.

This paper has been withdrawn because there is a fundamental error in the computations; with the right computational scheme it seems to be just a version of the Jones polynomial

The monochromatic tree partition number of an $r$-edge-colored graph $G$, denoted by $t_r(G)$, is the minimum integer $k$ such that whenever the edges of $G$ are colored with $r$ colors, the vertices of $G$ can be covered by at most $k$…

This paper is being withdrawn by the authors in order to correct some errors and also to introduce improved theoretical techniques.

This paper has been withdrawn by the author

The paper is withdrawn. The proof has an error and it requires a different approach.

This paper has been withdrawn.

This paper has been withdrawn by the authors. We have discovered an error in the evaluation of the diagram, which invalidates our conclusion.

This paper has been withdrawn by the author(s), due the final version in math.QA/0604564

This paper has been withdrawn since we combine this paper with math.AC/0503685. All contents of the paper have been moved to math.AC/0503685.

This paper has been withdrawn by the author, due an error in the proof of Proposion 2.13.

This paper has been withdrawn

This paper has been withdrawn by the author.

This paper has been withdrawn by the author due to an error in Lemma 3, making the (bijective) proof of Theorem 4 and Corollary 5 invalid (symmetry of k-nonnesting and k-noncrossing set partitions).

This paper has been withdrawn.

This paper has been withdrawn by the author.

The paper is withdrawn.

This paper has been withdrawn by the author due to a crucial error in equation.

This paper has been withdrawn by the author due to a crucial error in the submission action.