Diep Luong-Le

activity

20242026

most citedIs a LOCAL algorithm computable?

2 citations · 2 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2025

Relative discrepancy of hypergraphs

Diep Luong-Le, Tuan Tran, Dilong Yang

Given $k$ -uniform hypergraphs $G$ and $H$ on $n$ vertices with densities $p$ and $q$ , their relative discrepancy is defined as $\hbox{disc}(G,H)=\max\big||E(G')\cap E(H')|-pq\binom…

math.CO2024

The Planar Turán Number of $Θ_{6}$ -graphs

David Guan, Ervin Győri, Diep Luong-Le +2

There are two particular $Θ_{6}$ -graphs - the 6-cycle graphs with a diagonal. We find the planar Turán number of each of them, i.e. the maximum number of edges in a planar graph $G$ …

Relative discrepancy of hypergraphs

The Planar Turán Number of Θ6​-graphs

The Planar Turán Number of $Θ_{6}$ -graphs