activity
20132026
most citedA Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially

31 citations · 56 across the 21 of their papers we have counts for

collaborators
Showing 2026Show all

3 papers · 1 filter

cs.DM2026

The relaxation complexity of the standard simplex is logarithmic

Gennadiy Averkov, Simon Keil, Stefan Weltge

For a set of integer points, the relaxation complexity is the smallest number of facets of any polyhedron such that . In thi…

math.CO2026

Coloring t-perfect graphs with fewer colors

Matija Novaković, Stefan Weltge

Recently, Chudnovsky, Cook, Davies, Oum, and Tan obtained the first finite bound on the chromatic number of t-perfect graphs, showing that they are 199053-colorable. We improve thi…

math.CO2026

On the number of finite additive 2-bases

Stefan Weltge, Konrad Zyhalko

The number of finite additive 2-bases is known to grow exponentially. While this fact has been established by Marzuola and Miller (2010) using complex analytic techniques embedded…