Lower bounds on the number of crossing-free subgraphs of K_N
From MaRDI portal
Publication:1594599
Recommendations
- On the Number of Crossing‐Free Matchings, Cycles, and Partitions
- The Number of Crossing Free Configurations on Finite Point Sets in the Plane
- An improved lower bound on the maximum number of non-crossing spanning trees
- Lower bounds on the maximum number of non-crossing acyclic graphs
- A lower bound for the number of polygonizations of N points in the plane
Cited in
(53)- Transforming spanning trees: A lower bound
- Reconstruction of the path graph
- A QPTAS for the base of the number of crossing-free structures on a planar point set
- Point sets with many non-crossing perfect matchings
- A better upper bound on the number of triangulations of a planar point set
- A lower bound on the number of triangulations of planar point sets
- Disjoint compatible geometric matchings
- A combinatorial property on angular orders of plane point sets
- On numbers of pseudo-triangulations
- Connecting polygonizations via stretches and twangs
- Algorithmic enumeration of surrounding polygons
- Perfect matchings with crossings
- Counting polygon triangulations is hard
- Disjoint compatibility graph of non-crossing matchings of points in convex position
- Many touchings force many crossings
- A new lower bound on the maximum number of plane graphs using production matrices
- 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
- On the number of plane geometric graphs
- 4-holes in point sets
- On the number of pseudo-triangulations of certain point sets
- Circumscribing polygons and polygonizations for disjoint line segments
- A lower bound for the number of polygonizations of N points in the plane
- Configurations of non-crossing rays and related problems
- The Mathematics of Ferran Hurtado: A Brief Survey
- On the Number of Crossing‐Free Matchings, Cycles, and Partitions
- Convex polygons in geometric triangulations
- On the number of crossing-free partitions
- Hamiltonian Alternating Paths on Bicolored Double-Chains
- scientific article; zbMATH DE number 5555978 (Why is no real title available?)
- Crossing-free perfect matchings in wheel point sets
- Many touchings force many crossings
- Touching perfect matchings and halving lines
- On balanced 4-holes in bichromatic point sets
- Circumscribing polygons and polygonizations for disjoint line segments
- scientific article; zbMATH DE number 7559233 (Why is no real title available?)
- 2-opt moves and flips for area-optimal polygonizations
- Area-optimal simple polygonalizations: the CG challenge 2019
- Convex Polygons in Geometric Triangulations
- Counting plane graphs: cross-graph charging schemes
- An improved lower bound on the maximum number of non-crossing spanning trees
- Sequences of spanning trees and a fixed tree theorem
- Perfect matchings with crossings
- Convex hulls of random order types
- Non-crossing Hamiltonian paths and cycles in output-polynomial time
- Automated mathematical discovery and verification: minimizing pentagons in the plane
- On the number of drawings of a combinatorial triangulation
- Chains, Koch chains, and point sets with many triangulations
- The minimum number of peeling sequences of a point set
- On \(k\)-gons and \(k\)-holes in point sets
- Planar tree transformation: results and counterexample
- On the diameter of geometric path graphs of points in convex position
This page was built for publication: Lower bounds on the number of crossing-free subgraphs of \(K_N\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1594599)
