Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\)

DOI10.1137/22m1537497arXiv2210.01327MaRDI QIDQ6195951

Alan M. Frieze, Paweł Prałat, Deepak Bal

Publication date: 14 March 2024

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2210.01327

zbMATH Keywords

random graphsspanning treesrainbow structures\(G_{k-out}\) process

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the connectivity of random m-orientable graphs and digraphs
• Maximum matchings in a class of random graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Power of \(k\) choices and rainbow spanning trees in random graphs
• A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
• Rainbow Hamilton cycles in random graphs and hypergraphs
• Hamilton cycles in 3-out
• Multi-Coloured Hamilton Cycles in Random Edge-Coloured Graphs
• Rainbow Hamilton cycles in random regular graphs
• Multicolored trees in random graphs
• Rainbow perfect matchings and Hamilton cycles in the random geometric graph
• Rainbow hamilton cycles in random graphs

This page was built for publication: Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\)