Skip to main content Accesibility Help
×
×
Home

Planar Maps are Well Labeled Trees

  • Robert Cori (a1) and Bernard Vauquelin (a1)
Extract

In the theory of enumeration, the part devoted to the counting of planar maps gives rather surprising results. Of special interest to the combinatorialists is the conspicuous feature of counting numbers associated with families of maps as discussed in the papers of Tutte, Brown and Mullin. These formulas are by no means easy to prove; this is also a part of their charm. We are convinced therefore that these maps possess deep combinatorial properties. We discuss such properties in this paper.

The main result of this article is the construction of a bisection between planar maps and a special family of trees: their vertices are labeled with numbers that differ by at most 1 on adjacent vertices. These trees are said to be well labeled. Combinatorialists usually claim that theorems specifying the “geometry” of objects lead to enumerating formulas. Our result obeys this general rule: we can indeed obtain a new proof of the formula counting the number of rooted planar maps with m edges. Four different proofs of this formula are known to date.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Planar Maps are Well Labeled Trees
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Planar Maps are Well Labeled Trees
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Planar Maps are Well Labeled Trees
      Available formats
      ×
Copyright
References
Hide All
1. Cartier, P. and Foata, D., Problèmes combinatoires de commutation et rearrangement, Lecture Notes in Math. 55 (Springer-Verlag, Berlin, 1969).
2. Cori, R., Un code pour les graphes planaires et ses applications, Astérisque, Société Math, de France 27 (1975).
3. Cori, R. and Richard, J., Enumeration des graphes planaires à l'aide de séries formelles en variables non commutatives, Discrete Math. 2 (1972), 115162.
4. de Bruijn, N. G. and Morselt, B. J. M., A note on plane trees, J. Combinatorial Theory 2 (1967), 2734.
5. Edmonds, J., Combinatorial representation for polyhedral surfaces, Notices Amer. Math. Soc. 7 (1960), 646.
6. Foata, D. and Schûtzenberger, M. P., Théorie géométrique des polynômes eulériens, Lecture Notes in Math. 138 (Springer-Verlag, Berlin, 1970).
7. Jacques, A., Sur le genre d'une paire de substitutions, C. R. Acad. Sci. Paris 267 (1968), 625627.
8. Jacques, A., Constellations et graphes topologiques in Combinatorial theory and its applications, Colloq. Math. Soc. Janos Bolyai (North Holland Amsterdam, 1970), 657672.
9. Klarner, D. A., Correspondance between plane tree and binary sequences, J. Comb. Theory 9 (1970), 401411.
10. Lehman, A. B., A bijective census of rooted planar maps, Communication at Ontario Math. Conference (1970), unpublished.
11. Raney, G. N., Functional composition patterns and power series reversion, Trans. Amer. Math. Soc. 94 (1960), 441451.
12. Read, R. C., The coding of various kinds of unlabeled trees in Graph theory and computing (Academic Press, New York, 1972), 153182.
13. Tutte, W. T., A census of slicings, Can. J. Math. 14 (1962), 708722.
14. Tutte, W. T., A census of planar maps, Can. J. Math. 15 (1963), 249271.
15. Tutte, W. T., On the enumeration of planar maps, Bull. Amer. Math. Soc. 74 (1968), 6474.
16. Walsh, T. S. and Lehman, A. B., Counting rooted maps by genus I and II, J. Comb. Theory 13B (1972), 192218 and 122-141.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Canadian Journal of Mathematics
  • ISSN: 0008-414X
  • EISSN: 1496-4279
  • URL: /core/journals/canadian-journal-of-mathematics
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×
MathJax

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed