Rainbow subgraphs in properly edge‐colored graphs

DOI10.1002/rsa.3240030207zbMath0754.05039OpenAlexW2023163209WikidataQ105583250 ScholiaQ105583250MaRDI QIDQ3990220

Zsolt Tuza, Vojtěch Rödl

Publication date: 28 June 1992

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

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

zbMATH Keywords

rainbow cyclelarge girthedge-colored graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (17)

Anti-Ramsey threshold of cycles for sparse graphs ⋮ Constrained Ramsey numbers of graphs ⋮ Large Rainbow Cliques in Randomly Perturbed Dense Graphs ⋮ On the approximability of the minimum rainbow subgraph problem and other related problems ⋮ On an anti-Ramsey threshold for random graphs ⋮ Balanced edge-colorings avoiding rainbow cliques of size four ⋮ The anti-Ramsey threshold of complete graphs ⋮ Rainbow subgraphs in edge‐colored complete graphs: Answering two questions by Erdős and Tuza ⋮ An algorithmic framework for obtaining lower bounds for random Ramsey problems ⋮ Better lower and upper bounds for the minimum rainbow subgraph problem ⋮ A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph ⋮ Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey ⋮ Small rainbow cliques in randomly perturbed dense graphs ⋮ Rainbow faces in edge‐colored plane graphs ⋮ On an anti-Ramsey property of random graphs ⋮ Minimal colorings for properly colored subgraphs ⋮ Anti-Ramsey threshold of cycles

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Rainbow subgraphs in properly edge‐colored graphs