On an extremal problem for colored trees

DOI10.1006/eujc.1998.0248zbMath0924.05040OpenAlexW2016552975MaRDI QIDQ1279875

Pavel Valtr

Publication date: 10 November 1999

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1998.0248

zbMATH Keywords

tree coloringDavenport-Schinzel sequencesmaximum number of vertices

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

This page was built for publication: On an extremal problem for colored trees