Defective coloring of hypergraphs

IF 0.9 3区数学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Random Structures & Algorithms Pub Date : 2023-10-27 DOI:10.1002/rsa.21190

António Girão, Freddie Illingworth, Alex Scott, David R. Wood

引用次数: 0

Abstract

Abstract We prove that the vertices of every ‐uniform hypergraph with maximum degree may be colored with colors such that each vertex is in at most monochromatic edges. This result, which is best possible up to the value of the constant , generalizes the classical result of Erdős and Lovász who proved the case.

查看原文本刊更多论文

超图着色缺陷

摘要证明了每一个具有最大度的均匀超图的顶点都可以上色，使得每个顶点最多处于单色边。这个结果，是最好的可能到常数的值，推广了经典的结果Erdős和Lovász谁证明了这种情况。

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

求助全文

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

来源期刊

Random Structures & Algorithms 数学-计算机：软件工程

CiteScore

2.50

自引率

10.00%

发文量

审稿时长

>12 weeks

期刊介绍： It is the aim of this journal to meet two main objectives: to cover the latest research on discrete random structures, and to present applications of such research to problems in combinatorics and computer science. The goal is to provide a natural home for a significant body of current research, and a useful forum for ideas on future studies in randomness. Results concerning random graphs, hypergraphs, matroids, trees, mappings, permutations, matrices, sets and orders, as well as stochastic graph processes and networks are presented with particular emphasis on the use of probabilistic methods in combinatorics as developed by Paul Erdõs. The journal focuses on probabilistic algorithms, average case analysis of deterministic algorithms, and applications of probabilistic methods to cryptography, data structures, searching and sorting. The journal also devotes space to such areas of probability theory as percolation, random walks and combinatorial aspects of probability.