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

5 papers · 1 filter

math.CO2018

The biclique covering number of grids

Krystal Guo, Tony Huynh, Marco Macchia

We determine the exact value of the biclique covering number for all grid graphs.

math.CO2018★ 8 cited

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

Wouter Cames van Batenburg, Tony Huynh, Gwenaël Joret +1

Let $H$ be a planar graph. By a classical result of Robertson and Seymour, there is a function $f : N \to R$ such that for all $k \in N$ and all graphs $G$ …

math.CO2018

Short rainbow cycles in graphs and matroids

Matt DeVos, Matthew Drescher, Daryl Funk +5

Let $G$ be a simple $n$ -vertex graph and $c$ be a colouring of $E (G)$ with $n$ colours, where each colour class has size at least $2$ . We prove that $(G, c)$ contains a rainbow cycl…

cs.DM2018

Extension Complexity of the Correlation Polytope

Pierre Aboulker, Samuel Fiorini, Tony Huynh +2

We prove that for every $n$ -vertex graph $G$ , the extension complexity of the correlation polytope of $G$ is $2^{O (tw (G) + l o g n)}$ , where $tw (G)$ is the treewid…

math.CO2018★ 3 cited

Seymour's conjecture on 2-connected graphs of large pathwidth

Tony Huynh, Gwenaël Joret, Piotr Micek +1

We prove the conjecture of Seymour (1993) that for every apex-forest $H_{1}$ and outerplanar graph $H_{2}$ there is an integer $p$ such that every 2-connected graph of pathwidth at lea…