Pages that link to "Item:Q3990220"

The following pages link to Rainbow subgraphs in properly edge‐colored graphs (Q3990220):

Displaying 18 items.

• On an anti-Ramsey threshold for random graphs (Q402453) (← links)
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) (← links)
• On the approximability of the minimum rainbow subgraph problem and other related problems (Q1679237) (← links)
• An algorithmic framework for obtaining lower bounds for random Ramsey problems (Q1989950) (← links)
• Small rainbow cliques in randomly perturbed dense graphs (Q2065991) (← links)
• Anti-Ramsey threshold of cycles (Q2091804) (← links)
• Anti-Ramsey threshold of cycles for sparse graphs (Q2132335) (← links)
• Better lower and upper bounds for the minimum rainbow subgraph problem (Q2250438) (← links)
• A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph (Q2502039) (← links)
• Minimal colorings for properly colored subgraphs (Q2563425) (← links)
• The anti-Ramsey threshold of complete graphs (Q2689511) (← links)
• On an anti-Ramsey property of random graphs (Q2840714) (← links)
• Rainbow faces in edge‐colored plane graphs (Q3652543) (← links)
• Constrained Ramsey numbers of graphs (Q4798124) (← links)
• Large Rainbow Cliques in Randomly Perturbed Dense Graphs (Q5055643) (← links)
• Balanced edge-colorings avoiding rainbow cliques of size four (Q6133158) (← links)
• Rainbow subgraphs in edge‐colored complete graphs: Answering two questions by Erdős and Tuza (Q6201025) (← links)
• Rainbow cliques in randomly perturbed dense graphs (Q6604688) (← links)