Lower bounds on the maximum number of non-crossing acyclic graphs
- 1 August 2015
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 48, 48-62
Abstract
No abstract availableKeywords
All Related Versions
This publication has 5 references indexed in Scilit:
- An improved lower bound on the maximum number of non-crossing spanning trees2013
- 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
- Lower bounds on the number of crossing-free subgraphs of KNComputational Geometry, 2000
- Analytic combinatorics of non-crossing configurationsDiscrete Mathematics, 1999