Lower bounds on the maximum number of non-crossing acyclic graphs
Preprint
Abstract
This paper is a contribution to the problem of counting geometric graphs on point sets. More concretely, we look at the maximum numbers of non-crossing spanning trees and forests. We show that the so-called double chain point configuration of N points has Omega(12.52^N) non-crossing spanning trees and Omega(13.61^N) non-crossing forests. This improves the previous lower bounds on the maximum number of non-crossing spanning trees and of non-crossing forests among all sets of N points in general position given by Dumitrescu, Schulz, Sheffer and T\'oth. Our analysis relies on the tools of analytic combinatorics, which enable us to count certain families of forests on points in convex position, and to estimate their average number of components. A new upper bound of O(22.12^N) for the number of non-crossing spanning trees of the double chain is also obtained.Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- Bounds on the Maximum Multiplicity of Some Common Geometric GraphsSIAM Journal on Discrete Mathematics, 2013
- On the number of pseudo-triangulations of certain point setsJournal of Combinatorial Theory, Series A, 2008
- A Course in Combinatorics2001
- Analytic combinatorics of non-crossing configurationsDiscrete Mathematics, 1999
- Crossing-Free Subgraphs1982