Covering the Edges of a Random Hypergraph by Cliques

IF 0.5 4区数学 Q3 MATHEMATICS

Discussiones Mathematicae Graph Theory Pub Date : 2022-07-12 DOI:10.7151/dmgt.2431

V. Rödl, A. Rucinski

引用次数: 0

Abstract

Abstract We determine the order of magnitude of the minimum clique cover of the edges of a binomial, r-uniform, random hypergraph G(r)(n, p), p fixed. In doing so, we combine the ideas from the proofs of the graph case (r = 2) in Frieze and Reed [Covering the edges of a random graph by cliques, Combinatorica 15 (1995) 489–497] and Guo, Patten, Warnke [Prague dimension of random graphs, manuscript submitted for publication].

查看原文本刊更多论文

用团覆盖随机超图的边

摘要我们确定了二项式，r-一致，随机超图G（r）（n，p），p固定边的最小团覆盖的数量级。在这样做的过程中，我们结合了Frieze和Reed[用集团覆盖随机图的边，Combinatorica 15（1995）489–497]和Guo，Patten，Warnke[随机图的布拉格维度，提交出版的手稿]中图格（r=2）的证明的思想。

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

求助全文

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

来源期刊

Discussiones Mathematicae Graph Theory MATHEMATICS-

CiteScore

2.20

自引率

0.00%

发文量

审稿时长

53 weeks

期刊介绍： The Discussiones Mathematicae Graph Theory publishes high-quality refereed original papers. Occasionally, very authoritative expository survey articles and notes of exceptional value can be published. The journal is mainly devoted to the following topics in Graph Theory: colourings, partitions (general colourings), hereditary properties, independence and domination, structures in graphs (sets, paths, cycles, etc.), local properties, products of graphs as well as graph algorithms related to these topics.