An anti-Ramsey condition on trees
type: Item
instance of: scholarly article
title: An anti-Ramsey condition on trees
zbMATH Open document ID: 1182.05031
author: Michael E. Picollelli
published in: The Electronic Journal of Combinatorics
publication date: 2009-04-07T00:00:00Z
full work available at URL: https://eudml.org/doc/117220
full work available at URL: v15i1r24.html
review text: Summary: Let \(H\) be a finite tree. We consider trees \(T\) such that if the edges of \(T\) are colored so that no color occurs more than \(b\) times, then \(T\) has a subgraph isomorphic to \(H\) in which no color is repeated. We will show that if \(H\) falls into a few classes of trees, including those of diameter at most 4, then the minimum value of \(e(T)\) is provided by a known construction, supporting a conjecture of Bohman, Frieze, Pikhurko and Smyth.
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C55
zbMATH DE Number: 5540929
zbMATH Keywords: trees
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 5540929