Geodesic
An anti-Ramsey condition on trees
The electronic journal of combinatorics, Tome 15 (2008)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/748
Classification : 05C05, 05C15, 05C55
Mots-clés : trees 
@article{10_37236_748,
     author = {Michael E. Picollelli},
     title = {An {anti-Ramsey} condition on trees},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/748},
     zbl = {1182.05031},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/748/}
}
TY  - JOUR
AU  - Michael E. Picollelli
TI  - An anti-Ramsey condition on trees
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/748/
DO  - 10.37236/748
ID  - 10_37236_748
ER  - 
%0 Journal Article
%A Michael E. Picollelli
%T An anti-Ramsey condition on trees
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/748/
%R 10.37236/748
%F 10_37236_748
Michael E. Picollelli. An anti-Ramsey condition on trees. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/748

Cité par Sources :