Giant rainbow trees in sparse random graphs

DOI10.1016/J.EJC.2025.104184MaRDI QIDQ6957477zbMATH OpenFDO

Authors Tolson Bell, Alan Frieze

Publication date 16 July 2025

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJC.2025.104184

zbMATH Keywords

rainbow treessupercritical random graphs

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42) Random graphs (graph-theoretic aspects) (05C80) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Combinatorial probability (60C05)

Cites work

• Anatomy of the giant component: the strictly supercritical regime
• Cycles in a random graph near the critical point
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 3042129 (Why is no real title available?)
• Introduction to Random Graphs
• Multicolored trees in random graphs
• On the method of typical bounded differences
• On tree census and the giant component in sparse random graphs
• Rainbow thresholds
• Rainbow trees in uniformly edge‐colored graphs
• Random graphs.
• The emergence of a giant rainbow component
• The Evolution of Random Graphs
• The longest path in a random graph
• Thresholds versus fractional expectation-thresholds

This page was built for publication: Giant rainbow trees in sparse random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6957477)