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 2015Show all

4 papers · 1 filter

math.MG2015★ 9 cited

The excluded minors for isometric realizability in the plane

Samuel Fiorini, Tony Huynh, Gwenaël Joret +1

Let $G$ be a graph and $p \in [1, \infty]$ . The parameter $f_{p} (G)$ is the least integer $k$ such that for all $m$ and all vectors $(r_{v})_{v \in V (G)} \subseteq R^{m}$ , there…

math.CO2015★ 3 cited

Tree-chromatic number is not equal to path-chromatic number

Tony Huynh, Ringi Kim

For a graph $G$ and a tree-decomposition $(T, B)$ of $G$ , the chromatic number of $(T, B)$ is the maximum of $χ (G [B])$ , taken over all bags $B \in B$ .…

math.CO2015

Transfinite Ford-Fulkerson on a Finite Network

Spencer Backman, Tony Huynh

It is well-known that the Ford-Fulkerson algorithm for finding a maximum flow in a network need not terminate if we allow the arc capacities to take irrational values. Every non-te…

cs.CC2015

Space proof complexity for random 3-CNFs

Patrick Bennett, Ilario Bonacina, Nicola Galesi +3

We investigate the space complexity of refuting $3$ -CNFs in Resolution and algebraic systems. We prove that every Polynomial Calculus with Resolution refutation of a random $3$ -CNF…