4 papers
Conway's thrackle conjecture: a new upper bound of
Dániel Gábor Simon
A thrackle is a drawing of a graph in the plane in which every pair of edges meets exactly once, either at a common endpoint or at a proper crossing. Conway conjectured that every…
Piercing all maximum cliques in hypergraphs
Andreas Holmsen, Attila Jung, Balázs Keszegh +2
Graphs whose maximum clique size exceeds half of the total number of vertices satisfy a classical property: the family of their maximum sized cliques can be pierced by a single ver…
Convex Hull Thrackles
Balázs Keszegh, Dániel Simon
A \emph{thrackle} is a graph drawn in the plane so that every pair of its edges meet exactly once, either at a common end vertex or in a proper crossing. Conway's thrackle conjectu…
On the Rényi-Ulam Game with Restricted Size Queries
Ádám Fraknói, Dávid Márton, Dániel Simon +1
We investigate the following version of the well-known Rényi-Ulam game. Two players - the Questioner and the Responder - play against each other. The Responder thinks of a number f…