5 citations · 5 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2008
On the sum of the squared multiplicities of the distances in a point set over finite fields
Le Anh Vinh, Dang Phuong Dung
We study a finite analog of a conjecture of Erdös on the sum of the squared multiplicities of the distances determined by an -element point set. Our result is based on an estima…
math.CO2008★ 5 cited
Explicit tough Ramsey graphs
Le Anh Vinh, Dang Phuong Dung
A graph G is t-tough if any induced subgraph of it with x > 1 connected components is obtained from G by deleting at least tx vertices. Chvatal conjectured that there exists an abs…