Buchin, Kevin and Speckmann, Bettina and Verdonschot, Sander - On the number of regular edge labelings

dmtcs:2085 - Discrete Mathematics & Theoretical Computer Science, October 20, 2014, Vol. 16 no. 3 (in progress)
On the number of regular edge labelings

Authors: Buchin, Kevin and Speckmann, Bettina and Verdonschot, Sander

We prove that any irreducible triangulation on n vertices has O(4.6807n) regular edge labelings and that there are irreducible triangulations on n vertices with Ω(3.0426n) regular edge labelings. Our upper bound relies on a novel application of Shearer's entropy lemma. As an example of the wider applicability of this technique, we also improve the upper bound on the number of 2-orientations of a quadrangulation to O(1.87n).


Source : oai:HAL:hal-01188899v1
Volume: Vol. 16 no. 3 (in progress)
Section: Combinatorics
Published on: October 20, 2014
Submitted on: December 27, 2011
Keywords: regular edge labeling,counting,Shearer’s entropy lemma,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]


Share

Browsing statistics

This page has been seen 16 times.
This article's PDF has been downloaded 12 times.