Showing 2024Show all
2 papers · 1 filter
math.CO2024
Piercing intersecting convex sets
Imre Bárány, Travis Dillon, Dömötör Pálvölgyi +1
Assume two finite families and of convex sets in have the property that for every and $B\in \math…
math.CO2024
Diverse beam search to find densest-known planar unit distance graphs
Peter Engel, Owen Hammond-Lee, Yiheng Su +2
This paper addresses the problem of determining the maximum number of edges in a unit distance graph (UDG) of vertices using computer search. An unsolved problem of Paul Erdős…