Bounds on the Maximum Multiplicity of Some Common Geometric Graphs
From MaRDI portal
Publication:2848539
DOI10.1137/110849407zbMath1272.05079OpenAlexW2952626446WikidataQ115926339 ScholiaQ115926339MaRDI QIDQ2848539
André Schulz, Adrian Dumitrescu, Adam Sheffer, Csaba D. Tóth
Publication date: 26 September 2013
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2011/3050/
Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Erd?s problems and related topics of discrete geometry (52C10)
Related Items (22)
Configurations of non-crossing rays and related problems ⋮ Counting carambolas ⋮ A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set ⋮ Convex Polygons in Geometric Triangulations ⋮ Convex Polygons in Geometric Triangulations ⋮ On the number of anchored rectangle packings for a planar point set ⋮ On the Number of Anchored Rectangle Packings for a Planar Point Set ⋮ The Mathematics of Ferran Hurtado: A Brief Survey ⋮ Point sets with many non-crossing perfect matchings ⋮ Colored ray configurations ⋮ From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices ⋮ Counting polygon triangulations is hard ⋮ Counting triangulations of balanced subdivisions of convex polygons ⋮ Counting triangulations of some classes of subdivided convex polygons ⋮ Unnamed Item ⋮ Monotone paths in geometric triangulations ⋮ Convex polygons in Cartesian products ⋮ A new lower bound on the maximum number of plane graphs using production matrices ⋮ A Census of Plane Graphs with Polyline Edges ⋮ Counting triangulations and other crossing-free structures approximately ⋮ Lower bounds on the maximum number of non-crossing acyclic graphs ⋮ Counting triangulations and other crossing-free structures via onion layers
This page was built for publication: Bounds on the Maximum Multiplicity of Some Common Geometric Graphs
