Blockers for simple Hamiltonian paths in convex geometric graphs of even order

Chaya Keller, Micha A. Perles

Let G be a complete convex geometric graph on 2m vertices, and let F be a family of subgraphs of G. A blocker for F is a set of edges, of smallest possible size, that meets every e…