The effect of edge weights on clique weights

Raphael Yuster

doi:10.1016/j.laa.2016.11.036

The effect of edge weights on clique weights

Raphael Yuster

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	298-312
Number of pages	15
Journal	Linear Algebra and Its Applications
Volume	515
DOIs	https://doi.org/10.1016/j.laa.2016.11.036
State	Published - 15 Feb 2017

Bibliographical note

Publisher Copyright:
© 2016 Elsevier Inc.

Keywords

Inclusion matrices
Weighted hypergraphs

ASJC Scopus subject areas

Algebra and Number Theory
Numerical Analysis
Geometry and Topology
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.laa.2016.11.036

Cite this

@article{b46e60d5623148cb954f6e2592c7e171,

title = "The effect of edge weights on clique weights",

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.",

keywords = "Inclusion matrices, Weighted hypergraphs",

author = "Raphael Yuster",

note = "Publisher Copyright: {\textcopyright} 2016 Elsevier Inc.",

year = "2017",

month = feb,

day = "15",

doi = "10.1016/j.laa.2016.11.036",

language = "English",

volume = "515",

pages = "298--312",

journal = "Linear Algebra and Its Applications",

issn = "0024-3795",

publisher = "Elsevier",

}

TY - JOUR

T1 - The effect of edge weights on clique weights

AU - Yuster, Raphael

PY - 2017/2/15

Y1 - 2017/2/15

N2 - 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.

AB - 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.

KW - Inclusion matrices

KW - Weighted hypergraphs

UR - http://www.scopus.com/inward/record.url?scp=84998774611&partnerID=8YFLogxK

U2 - 10.1016/j.laa.2016.11.036

DO - 10.1016/j.laa.2016.11.036

M3 - Article

AN - SCOPUS:84998774611

SN - 0024-3795

VL - 515

SP - 298

EP - 312

JO - Linear Algebra and Its Applications

JF - Linear Algebra and Its Applications

ER -

The effect of edge weights on clique weights

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this