| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5773196 | Linear Algebra and its Applications | 2017 | 15 Pages |
Abstract
Suppose the edges of the complete r-graph on n vertices are weighted with real values. For râ¤kâ¤n, the weight of a k-clique is the sum of the weights of its edges. Given the largest gap between the weights of two distinct edges, how small can the largest gap between the weights of two distinct k-cliques be? We answer this question precisely.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Raphael Yuster,