On triangulations with high vertex degree

Details On triangulations with high vertex degree On triangulations with high vertex degree

2006-01-27

arxiv.org/abs/math/0601678v1

Annals of Combinatorics 12, 1 (2008) 17-44

Mathematics

Combinatorics

Scientific paper

We solve three enumerative problems concerning families of planar maps. More precisely, we establish algebraic equations for the generating function of non-separable triangulations in which all vertices have degree at least d, for a certain value d chosen in {3, 4, 5}. The originality of the problem lies in the fact that degree restrictions are placed both on vertices and faces. Our proofs first follow Tutte's classical approach: we decompose maps by deleting the root and translate the decomposition into an equation satisfied by the generating function of the maps under consideration. Then we proceed to solve the equation obtained using a recent technique that extends the so-called quadratic method.

Affiliated with

Also associated with

No associations

Rating

On triangulations with high vertex degree 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 On triangulations with high vertex degree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On triangulations with high vertex degree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-506171