Pages that link to "Item:Q1911768"
From MaRDI portal
The following pages link to Extremal theory for convex matchings in convex geometric graphs (Q1911768):
Displaying 13 items.
- On convex geometric graphs with no \(k+1\) pairwise disjoint edges (Q503641) (← links)
- Blockers for simple Hamiltonian paths in convex geometric graphs of even order (Q724939) (← links)
- Extreme points of two digraph polytopes: Description and applications in economics and game theory (Q952685) (← links)
- A Turán-type theorem on chords of a convex polygon (Q1204472) (← links)
- Extremal problems for pairs of triangles (Q2131860) (← links)
- Ordered and convex geometric trees with linear extremal function (Q2197686) (← links)
- Blockers for triangulations of a convex polygon and a geometric maker-breaker game (Q2205124) (← links)
- Blockers for simple Hamiltonian paths in convex geometric graphs of odd order (Q2225656) (← links)
- Saturation problems in convex geometric hypergraphs (Q2701003) (← links)
- The geometry of convex affine maximal graphs (Q2774473) (← links)
- Extremal problems for convex geometric hypergraphs and ordered hypergraphs (Q5021260) (← links)
- On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane (Q5951972) (← links)
- Maximum matchings in geometric intersection graphs (Q6050213) (← links)