Some results and problems on clique coverings of hypergraphs

IF 0.9 3区数学 Q2 MATHEMATICS

Journal of Graph Theory Pub Date : 2024-06-11 DOI:10.1002/jgt.23111

Vojtech Rödl, Marcelo Sales

{"title":"Some results and problems on clique coverings of hypergraphs","authors":"Vojtech Rödl, Marcelo Sales","doi":"10.1002/jgt.23111","DOIUrl":null,"url":null,"abstract":"For a <math>\n <semantics>\n <mrow>\n <mi>k</mi>\n </mrow>\n <annotation> $k$</annotation>\n </semantics></math>-uniform hypergraph <math>\n <semantics>\n <mrow>\n <mi>F</mi>\n </mrow>\n <annotation> $F$</annotation>\n </semantics></math> we consider the parameter <math>\n <semantics>\n <mrow>\n <mi>Θ</mi>\n <mrow>\n <mo>(</mo>\n \n <mi>F</mi>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n <annotation> ${\\rm{\\Theta }}(F)$</annotation>\n </semantics></math>, the minimum size of a clique cover of the edge set of <math>\n <semantics>\n <mrow>\n <mi>F</mi>\n </mrow>\n <annotation> $F$</annotation>\n </semantics></math>. We derive bounds on <math>\n <semantics>\n <mrow>\n <mi>Θ</mi>\n <mrow>\n <mo>(</mo>\n \n <mi>F</mi>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n <annotation> ${\\rm{\\Theta }}(F)$</annotation>\n </semantics></math> for <math>\n <semantics>\n <mrow>\n <mi>F</mi>\n </mrow>\n <annotation> $F$</annotation>\n </semantics></math> belonging to various classes of hypergraphs.","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"107 2","pages":"442-457"},"PeriodicalIF":0.9000,"publicationDate":"2024-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23111","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23111","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

Abstract

For a $k$ -uniform hypergraph $F$ we consider the parameter $Θ (F)$ , the minimum size of a clique cover of the edge set of $F$ . We derive bounds on $Θ (F)$ for $F$ belonging to various classes of hypergraphs.

查看原文本刊更多论文

关于超图的簇覆盖的一些结果和问题

对于一个 k $k$ 的均匀超图 F $F$ ，我们考虑参数 Θ ( F ) ${rm{\Theta }}(F)$ ，即 F $F$ 边集的簇覆盖的最小大小。我们推导出属于各种超图类别的 F $F$ 的 Θ ( F ) ${\rm{\Theta }}(F)$ 的边界。

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

求助全文

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

来源期刊

Journal of Graph Theory 数学-数学

CiteScore

1.60

自引率

22.20%

发文量

130

审稿时长

6-12 weeks

期刊介绍： The Journal of Graph Theory is devoted to a variety of topics in graph theory, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs. The scope of the journal also includes related areas in combinatorics and the interaction of graph theory with other mathematical sciences. A subscription to the Journal of Graph Theory includes a subscription to the Journal of Combinatorial Designs .