T. Tran

collaborators

2 papers

cs.DS2026

Three trees suffice for a constant stretch in minor-free graphs

Hung Le, Huy Pham, Cuong Than +1

In this short note, we show that $H$ -minor-free graphs have a tree cover with $3$ trees and constant stretch for any fixed graph $H$ . The number of trees matches the recent lower b…

math.CO2026

Beating the Ahlswede--Khachatrian bound for the ErdÅs--Frankl--Pach problem

Tuan Tran, Zixiang Xu

In the 1980s, ErdÅs and, independently, Frankl and Pach conjectured that, for sufficiently large $n$ , every $(d + 1)$ -uniform family on ${1, \dots, n}$ with VC-dimension $d$ has si…

Three trees suffice for a constant stretch in minor-free graphs

Beating the Ahlswede--Khachatrian bound for the ErdÅs--Frankl--Pach problem

Beating the Ahlswede--Khachatrian bound for the ErdÅs--Frankl--Pach problem