Pages that link to "Item:Q1594599"
From MaRDI portal
The following pages link to Lower bounds on the number of crossing-free subgraphs of \(K_N\) (Q1594599):
Displaying 39 items.
- Configurations of non-crossing rays and related problems (Q282735) (← links)
- On the number of crossing-free partitions (Q359753) (← links)
- On balanced 4-holes in bichromatic point sets (Q482334) (← links)
- Monotone paths in geometric triangulations (Q726107) (← links)
- On \(k\)-gons and \(k\)-holes in point sets (Q899713) (← links)
- Planar tree transformation: results and counterexample (Q975528) (← links)
- On the diameter of geometric path graphs of points in convex position (Q976134) (← links)
- Transforming spanning trees: A lower bound (Q1028225) (← links)
- Reconstruction of the path graph (Q1615670) (← links)
- A QPTAS for the base of the number of crossing-free structures on a planar point set (Q1698728) (← links)
- Point sets with many non-crossing perfect matchings (Q1699275) (← links)
- A better upper bound on the number of triangulations of a planar point set (Q1873821) (← links)
- A lower bound on the number of triangulations of planar point sets (Q1882855) (← links)
- Disjoint compatible geometric matchings (Q1942309) (← links)
- A combinatorial property on angular orders of plane point sets (Q1944953) (← links)
- On numbers of pseudo-triangulations (Q1947983) (← links)
- Connecting polygonizations via stretches and twangs (Q1959392) (← links)
- Algorithmic enumeration of surrounding polygons (Q1983143) (← links)
- Perfect matchings with crossings (Q2169938) (← links)
- Counting polygon triangulations is hard (Q2223620) (← links)
- Disjoint compatibility graph of non-crossing matchings of points in convex position (Q2263780) (← links)
- Many touchings force many crossings (Q2312603) (← links)
- A new lower bound on the maximum number of plane graphs using production matrices (Q2331222) (← links)
- Counting triangulations and other crossing-free structures approximately (Q2341692) (← links)
- Lower bounds on the maximum number of non-crossing acyclic graphs (Q2346577) (← links)
- Counting triangulations and other crossing-free structures via onion layers (Q2351010) (← links)
- On the number of plane geometric graphs (Q2373434) (← links)
- 4-holes in point sets (Q2450200) (← links)
- On the number of pseudo-triangulations of certain point sets (Q2474495) (← links)
- Circumscribing polygons and polygonizations for disjoint line segments (Q2671176) (← links)
- The Mathematics of Ferran Hurtado: A Brief Survey (Q2958111) (← links)
- Convex Polygons in Geometric Triangulations (Q3449827) (← links)
- Hamiltonian Alternating Paths on Bicolored Double-Chains (Q3611851) (← links)
- Crossing-Free Perfect Matchings in Wheel Point Sets (Q4604397) (← links)
- Many Touchings Force Many Crossings (Q4625108) (← links)
- Touching perfect matchings and halving lines (Q4629554) (← links)
- (Q5088936) (← links)
- (Q5088963) (← links)
- Perfect matchings with crossings (Q6119827) (← links)
