论随机正则超图的色度数
IF 0.9
3区 数学
Q2 MATHEMATICS
引用次数: 0
摘要
SIAM 离散数学杂志》第 38 卷第 2 期第 1369-1380 页，2024 年 6 月。摘要。我们估计了固定[数学]、大固定[数学]和[数学]顶点上随机[数学]-均匀[数学]-规则超图的色度数和独立性数的可能值。本文章由计算机程序翻译，如有差异，请以英文原文为准。
On the Chromatic Number of Random Regular Hypergraphs
SIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1369-1380, June 2024.
Abstract. We estimate the likely values of the chromatic and independence numbers of the random [math]-uniform [math]-regular hypergraph on [math] vertices for fixed [math], large fixed [math], and [math].
Abstract. We estimate the likely values of the chromatic and independence numbers of the random [math]-uniform [math]-regular hypergraph on [math] vertices for fixed [math], large fixed [math], and [math].
求助全文
通过发布文献求助，成功后即可免费获取论文全文。
去求助
来源期刊
CiteScore
1.90
自引率
0.00%
发文量
124
审稿时长
4-8 weeks
期刊介绍：
SIAM Journal on Discrete Mathematics (SIDMA) publishes research papers of exceptional quality in pure and applied discrete mathematics, broadly interpreted. The journal''s focus is primarily theoretical rather than empirical, but the editors welcome papers that evolve from or have potential application to real-world problems. Submissions must be clearly written and make a significant contribution.
Topics include but are not limited to:
properties of and extremal problems for discrete structures
combinatorial optimization, including approximation algorithms
algebraic and enumerative combinatorics
coding and information theory
additive, analytic combinatorics and number theory
combinatorial matrix theory and spectral graph theory
design and analysis of algorithms for discrete structures
discrete problems in computational complexity
discrete and computational geometry
discrete methods in computational biology, and bioinformatics
probabilistic methods and randomized algorithms.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
