Scholarlink

Abstract <p> We investigate the sharpness of general discrepancy estimates for hypergraphs, including weighted ones. We show that in the case when the number of vertices is equal to the number of edges, the average and minimal discrepancies may asymptotically diverge. Moreover, we find a class of vertex-weighted hypergraphs for which the discrepancy estimate is asymptotically order-optimal (as the number of vertices tends to infinity). </p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

On Discrepancy in Systems of Subsets

  • 期刊论文

  • 发表日期：

    2025年12月1日

查看全文
  • S. V. Astashkin,
  • K. V. Lykov

摘要

Abstract

We investigate the sharpness of general discrepancy estimates for hypergraphs, including weighted ones. We show that in the case when the number of vertices is equal to the number of edges, the average and minimal discrepancies may asymptotically diverge. Moreover, we find a class of vertex-weighted hypergraphs for which the discrepancy estimate is asymptotically order-optimal (as the number of vertices tends to infinity).