Extremal problems for colored trees and Davenport-Schinzel sequences

DOI10.1016/S0012-365X(99)90101-2zbMath0936.05060MaRDI QIDQ1292853

Martin Klazar

Publication date: 18 May 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

upper boundscolorextremal numbersDavenport-Schinzel sequencescolored pathshort pathscolored tree

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• Generalized Davenport-Schinzel sequences with linear upper bound
• A linear upper bound in extremal theory of sequences
• Generalized Davenport-Schinzel sequences
• Combinatorial aspects of Davenport-Schinzel sequences
• On geometric graphs with no \(k\) pairwise parallel edges
• On \(abab\)-free and \(abba\)-free set partitions
• On a problem of Davenport and Schinzel
• Efficiency of a Good But Not Linear Set Union Algorithm
• A Combinatorial Problem Connected with Differential Equations

This page was built for publication: Extremal problems for colored trees and Davenport-Schinzel sequences