Extremal problems for colored trees and Davenport-Schinzel sequences

DOI10.1016/S0012-365X(99)90101-2zbMATH Open0936.05060MaRDI QIDQ1292853FDOQ1292853

Martin Klazar

Publication date: 18 May 2000

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

Recommendations

• On an extremal problem for colored trees
• Davenport-Schinzel trees
• scientific article; zbMATH DE number 1341926

zbMATH Keywords

upper boundsextremal numberscolorDavenport-Schinzel sequencescolored pathshort pathscolored tree

Mathematics Subject Classification ID

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

Cites Work

• On \(abab\)-free and \(abba\)-free set partitions
• Efficiency of a Good But Not Linear Set Union Algorithm
• Title not available (Why is that?)
• On geometric graphs with no \(k\) pairwise parallel edges
• 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
• Title not available (Why is that?)
• A Combinatorial Problem Connected with Differential Equations
• Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
• On a problem of Davenport and Schinzel
• Title not available (Why is that?)
• Combinatorial aspects of Davenport-Schinzel sequences

Cited In (4)

• Davenport-Schinzel trees
• Extremal problems on detectable colorings of trees
• On an extremal problem for colored trees
• Extremal problems for trees with given segment sequence

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292853)