On Minimum Cost Rainbow Structures
Patrick Bennett, Quentin Dubroff, Alan Frieze, Wesley Pegden
TL;DR
This paper investigates the expected minimum cost of rainbow spanning trees and Hamilton cycles in randomly edge-colored random graphs, providing insights into their probabilistic properties and optimization.
Contribution
It introduces new analysis of the minimum cost of rainbow structures in random graphs with random edge coloring.
Findings
Characterization of expected minimum costs
Probabilistic bounds for rainbow spanning trees
Analysis of rainbow Hamilton cycles
Abstract
We discuss the expected minimum cost of rainbow spanning trees and Hamilton cycles in randomly edge colored random graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Stochastic processes and statistical mechanics · Markov Chains and Monte Carlo Methods