H. Bergold

activity

20192026

most citedInvestigating Simple Drawings of

K_{n}

using SAT

1 citations · 4 across the 13 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019

A Semi-strong Perfect Digraph Theorem

Stephan Dominique Andres, Helena Bergold, Winfried Hochstättler +1

Reed showed that, if two graphs are $P_{4}$ -isomorphic, then either both are perfect or none of them is. In this note we will derive an analogous result for perfect digraphs.

math.CO2019

On the Geometry of Holmsen's Combinatorial Version of the Colorful Carathéodory

Helena Bergold, Winfried Hochstättler

Carathéodorys Theorem of convex hulls plays an important role in convex geometry. In 1982, Bárány formulated and proved a more general version, called the Colorful Carathéodory. Th…