2 citations · 2 across the 5 of their papers we have counts for
7 papers
Asymptotic structure. IV. A counterexample to the weak coarse Menger conjecture
Tung Nguyen, Alex Scott, Paul Seymour
Coarse graph theory concerns finding 'coarse' analogues of graph theory theorems, replacing disjointness with being far apart. One of the most interesting open questions is to find…
An Admissible Shift-Consistent Method for Recommender Systems
Tung Nguyen, Jeffrey Uhlmann
In this paper, we propose a new constraint, called shift-consistency, for solving matrix/tensor completion problems in the context of recommender systems. Our method provably guara…
Polynomial bounds for chromatic number VIII. Excluding a path and a complete multipartite graph
Tung Nguyen, Alex Scott, Paul Seymour
We prove that for every path H, and every integer d, there is a polynomial f such that every graph G with chromatic number greater than f(t) either contains H as an induced subgrap…
A note on the Gyárfás-Sumner conjecture
Tung Nguyen, Alex Scott, Paul Seymour
The Gyárfás-Sumner conjecture says that for every tree and every integer , if is a graph with no clique of size and with sufficiently large chromatic number, th…
A Simple and Scalable Tensor Completion Algorithm via Latent Invariant Constraint for Recommendation System
Tung Nguyen, Sang T. Truong, Jeffrey Uhlmann
In this paper we provide a latent-variable formulation and solution to the recommender system (RS) problem in terms of a fundamental property that any reasonable solution should be…
Canonical Tensor Scaling
Tung D. Nguyen, Jeffrey Uhlmann
In this paper we generalize the canonical positive scaling of rows and columns of a matrix to the scaling of selected-rank subtensors of an arbitrary tensor. We expect our results…