Tony Huynh

activity

20122026

most citedA unified Erdős-Pósa theorem for constrained cycles

20 citations · 171 across the 37 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

math.CO2017

Strengthening Convex Relaxations of 0/1-Sets Using Boolean Formulas

Samuel Fiorini, Tony Huynh, Stefan Weltge

In convex integer programming, various procedures have been developed to strengthen convex relaxations of sets of integer points. On the one hand, there exist several general-purpo…

cs.DM2017★ 2 cited

A tight Erdős-Pósa function for wheel minors

Pierre Aboulker, Samuel Fiorini, Tony Huynh +3

Let $W_{t}$ denote the wheel on $t + 1$ vertices. We prove that for every integer $t \geq 3$ there is a constant $c = c (t)$ such that for every integer $k \geq 1$ and every graph $G$ , eit…

cs.DM2017★ 4 cited

Extension complexity of stable set polytopes of bipartite graphs

Manuel Aprile, Yuri Faenza, Samuel Fiorini +2

The extension complexity $xc (P)$ of a polytope $P$ is the minimum number of facets of a polytope that affinely projects to $P$ . Let $G$ be a bipartite graph with $n$ verti…