Hoang La

collaborators

4 papers

math.CO2026

On some posets and lattices with the same height

Hoan La

For a finite poset $P$ , its height $h (P)$ is the number of cover relations in its longest chain. When $P$ is a lattice $L$ , we label its ele…

math.CO2026

The grid-minor theorem revisited

Vida DujmoviÄ, Robert Hickingbotham, JÄdrzej Hodor +6

We prove that for every planar graph $X$ of treedepth $h$ , there exists a positive integer $c$ such that for every $X$ -minor-free graph $G$ , there exists a graph $H$ of treewidth a…

math.CO2025

Boolean dimension of a Boolean lattice

Marcin BriaÅski, JÄdrzej Hodor, Hoang La +2

For every integer $n$ with $n \geq 6$ , we prove that the Boolean dimension of a poset consisting of all the subsets of ${1, \dots, n}$ equipped with the inclusion relation is stric…

math.CO2025

2-distance 4-coloring of planar subcubic graphs with girth at least 21

Hoang La, Mickael Montassier

A $2$ -distance $k$ -coloring of a graph is a proper vertex $k$ -coloring where vertices at distance at most 2 cannot share the same color. We prove the existence of a $2$ -distance $4…