Multicolored trees in random graphs

DOI10.1002/RSA.3240050107MaRDI QIDQ4288877zbMATH OpenOpenAlexWikidataFDO

Authors Brendan D. McKay, Alan Frieze

Publication date 15 September 1994

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.3240050107

zbMATH Keywords

coloringrandom graphstree

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Power of \(k\) choices and rainbow spanning trees in random graphs
• Rainbow trees in uniformly edge‐colored graphs
• Multitrees in random graphs
• Maximum colored trees in edge-colored graphs

Cited in

(13)

• Uniqueness of uniform random colorings of regular trees
• Power of \(k\) choices and rainbow spanning trees in random graphs
• Multitrees in random graphs
• Rainbow arborescence in random digraphs
• Pattern colored Hamilton cycles in random graphs
• scientific article; zbMATH DE number 1787232 (Why is no real title available?)
• Notes on growing a tree in a graph
• Rainbow Hamilton cycles in random graphs
• Rainbow trees in uniformly edge‐colored graphs
• Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\)
• Giant rainbow trees in sparse random graphs
• The emergence of a giant rainbow component
• On rainbow thresholds

This page was built for publication: Multicolored trees in random graphs

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