Rainbow Spanning Trees in Randomly Colored [math]

IF 0.9 3区数学 Q2 MATHEMATICS

SIAM Journal on Discrete Mathematics Pub Date : 2024-02-27 DOI:10.1137/22m1537497

Deepak Bal, Alan Frieze, Paweł Prałat

引用次数: 0

Abstract

SIAM Journal on Discrete Mathematics, Volume 38, Issue 1, Page 867-882, March 2024.
Abstract. Given a graph [math] on [math] vertices and an assignment of colors to its edges, a set of edges [math] is said to be rainbow if edges from [math] have pairwise different colors assigned to them. In this paper, we investigate rainbow spanning trees in randomly colored random [math] graphs.

查看原文本刊更多论文

随机彩色彩虹生成树[数学］

SIAM 离散数学杂志》，第 38 卷，第 1 期，第 867-882 页，2024 年 3 月。摘要。给定[math]顶点上的图[math]及其边的颜色赋值，如果[math]中的边有成对的不同颜色赋值，则称一组边[math]为彩虹边。本文研究了随机颜色随机 [math] 图中的彩虹生成树。

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

求助全文

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

来源期刊

SIAM Journal on Discrete Mathematics 数学-应用数学

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.