Lower bounds on the maximum number of non-crossing acyclic graphs

DOI10.1016/j.ejc.2015.02.008zbMath1314.05099arXiv1310.5882OpenAlexW1979048780WikidataQ61732467 ScholiaQ61732467MaRDI QIDQ2346577

Anna de Mier, Clemens Huemer

Publication date: 2 June 2015

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.5882

zbMATH Keywords

counting geometric graphs on point sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (1)

A new lower bound on the maximum number of plane graphs using production matrices

Cites Work

• Analytic combinatorics of non-crossing configurations
• Lower bounds on the number of crossing-free subgraphs of \(K_N\)
• On the number of pseudo-triangulations of certain point sets
• Counting Plane Graphs: Flippability and Its Applications
• Bounds on the Maximum Multiplicity of Some Common Geometric Graphs
• Crossing-Free Subgraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lower bounds on the maximum number of non-crossing acyclic graphs