1 citations · 1 across the 24 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.CO2018
A new lower bound on Hadwiger-Debrunner numbers in the plane
Chaya Keller, Shakhar Smorodinsky
A family of sets is said to satisfy the property if among any sets in , some have a non-empty intersection. Hadwiger and Debrunner (1957) conjectured that fo…
math.CO2018
Blockers for simple Hamiltonian paths in convex geometric graphs of odd order
Chaya Keller, Micha A. Perles
Let G be a complete convex geometric graph, and let F be a family of subgraphs of G. A blocker for F is a set of edges, of smallest possible size, that has an edge in common with e…