不具有Bk性质的简单一致超图最小边数的新下界

IF 0.3 Q4 MATHEMATICS, APPLIED

Discrete Mathematics and Applications Pub Date : 2022-06-01 DOI:10.1515/dma-2022-0015

Y. Demidovich

{"title":"不具有Bk性质的简单一致超图最小边数的新下界","authors":"Y. Demidovich","doi":"10.1515/dma-2022-0015","DOIUrl":null,"url":null,"abstract":"Abstract A hypergraph H = (V, E) has the property Bk if there exists an assignment of two colors to V such that each edge contains at least k vertices of each color. A hypergraph is called simple if every two edges of it have at most one common vertex. We obtain a new lower bound for the minimal number of edges of n-uniform simple hypergraph without the property Bk.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New lower bound for the minimal number of edges of simple uniform hypergraph without the property Bk\",\"authors\":\"Y. Demidovich\",\"doi\":\"10.1515/dma-2022-0015\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract A hypergraph H = (V, E) has the property Bk if there exists an assignment of two colors to V such that each edge contains at least k vertices of each color. A hypergraph is called simple if every two edges of it have at most one common vertex. We obtain a new lower bound for the minimal number of edges of n-uniform simple hypergraph without the property Bk.\",\"PeriodicalId\":11287,\"journal\":{\"name\":\"Discrete Mathematics and Applications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2022-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/dma-2022-0015\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/dma-2022-0015","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

摘要

超图H=（V，E）具有Bk性质，如果存在两种颜色对V的赋值，使得每条边至少包含每种颜色的k个顶点。如果超图的每两条边最多有一个公共顶点，则超图称为简单超图。我们得到了不具有Bk性质的n-一致简单超图的最小边数的一个新的下界。

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

查看原文本刊更多论文

New lower bound for the minimal number of edges of simple uniform hypergraph without the property Bk

Abstract A hypergraph H = (V, E) has the property Bk if there exists an assignment of two colors to V such that each edge contains at least k vertices of each color. A hypergraph is called simple if every two edges of it have at most one common vertex. We obtain a new lower bound for the minimal number of edges of n-uniform simple hypergraph without the property Bk.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Discrete Mathematics and Applications MATHEMATICS, APPLIED-

CiteScore

0.60

自引率

20.00%

发文量

期刊介绍： The aim of this journal is to provide the latest information on the development of discrete mathematics in the former USSR to a world-wide readership. The journal will contain papers from the Russian-language journal Diskretnaya Matematika, the only journal of the Russian Academy of Sciences devoted to this field of mathematics. Discrete Mathematics and Applications will cover various subjects in the fields such as combinatorial analysis, graph theory, functional systems theory, cryptology, coding, probabilistic problems of discrete mathematics, algorithms and their complexity, combinatorial and computational problems of number theory and of algebra.