Finding partite hypergraphs efficiently

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters Pub Date : 2026-04-01 Epub Date: 2026-02-11 DOI:10.1016/j.ipl.2026.106624

Ferran Espuña

引用次数: 0

Abstract

We provide a deterministic polynomial-time algorithm (for fixed k) that, for a given k-uniform hypergraph H with n vertices and edge density d, finds a complete k-partite subgraph of H with parts of size at least

c (d, k) {(\log n)}^{1 / (k - 1)}

. This generalizes work by Mubayi and Turán on bipartite graphs. The value we obtain for the part size matches the order of magnitude guaranteed by the non-constructive proof due to Erdős and is tight up to a constant factor.

查看原文本刊更多论文

高效地寻找部超图

我们提供了一种确定性多项式时间算法（对于固定k），对于给定的具有n个顶点和边密度d的k-均匀超图H，找到H的完整k部子图，其部分大小至少为c(d,k)(logn)1/(k−1)。这推广了Mubayi和Turán在二部图上的工作。我们获得的零件尺寸值与由于Erdős的非建设性证明所保证的数量级相匹配，并且紧密到一个常数因子。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Information Processing Letters 工程技术-计算机：信息系统

CiteScore

1.80

自引率

0.00%

发文量

审稿时长

7.3 months

期刊介绍： Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.