The threshold for the full perfect matching color profile in a random coloring of random graphs

DOI10.37236/9066zbMath1456.05140arXiv1910.07674OpenAlexW3092219661MaRDI QIDQ2223476

Mihir Hasabnis, Debsoumya Chakraborti

Publication date: 29 January 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (1)

Colorful Hamilton Cycles in Random Graphs

Cites Work

• Unnamed Item
• Some remarks on rainbow connectivity
• The hitting time of rainbow connection number two
• Rainbow matchings and Hamilton cycles in random graphs
• Universality of random graphs and rainbow embedding
• Introduction to Random Graphs
• Rainbow Hamilton cycles in random graphs and hypergraphs
• Pattern Colored Hamilton Cycles in Random Graphs
• Elegantly Colored Paths and Cycles in Edge Colored Random Graphs
• Rainbow Hamilton cycles in random regular graphs
• Rainbow Connection of Random Regular Graphs
• Rainbow hamilton cycles in random graphs

This page was built for publication: The threshold for the full perfect matching color profile in a random coloring of random graphs