Permutations with forbidden subsequences and nonseparable planar maps

@article{Dulucq1996PermutationsWF,
  title={Permutations with forbidden subsequences and nonseparable planar maps},
  author={Serge Dulucq and S. Gire and J. West},
  journal={Discrete Mathematics},
  year={1996},
  volume={153},
  pages={85-103}
}
The goal of the present work is to connect combinatorially a family of maps to a family of permutations with forbidden subsequences. We obtain a generating tree of nonseparable planar rooted maps and show that this tree is the generating tree of a family of permutations. The distribution of these permutations is then obtained. Finally, the different steps leading to the combinatorial proof of West's conjecture are listed. 

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 47 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Tutte, On the enumeration of rooted nonseparable planar maps, Can

W.T.W.G. Brown
J. Math • 1964
View 8 Excerpts
Highly Influenced

Enumeration of nonseparable planar maps, Can

W. G. Brown
J. Math • 1963
View 4 Excerpts
Highly Influenced

Sorting Twice Through a Stack

Theor. Comput. Sci. • 1993

Planar maps are well labeled trees

B. Vauquelin
Can . J . Math . • 1981

Planar maps are well labeled trees, Can

R. Cori, B. Vauquelin
J. Math • 1981
View 2 Excerpts

Counting rooted maps by genus IIl : nonseparable maps

T. S. Walsh
J . Combin . Theory B • 1975

Counting rooted maps by genus i and II

A. B. Lehman, T. S. Walsh
Sur les +ventails de segments, Cahiers BURO, Paris, • 1970
View 1 Excerpt

The enumeration of H amiltonian polygons in triangular maps

F. Schmidt
Pacific J . Math . • 1966

Similar Papers

Loading similar papers…