Extremal problems for colored trees and Davenport-Schinzel sequences
From MaRDI portal
(Redirected from Publication:1292853)
Recommendations
Cites work
- scientific article; zbMATH DE number 427792 (Why is no real title available?)
- scientific article; zbMATH DE number 732977 (Why is no real title available?)
- scientific article; zbMATH DE number 888842 (Why is no real title available?)
- A Combinatorial Problem Connected with Differential Equations
- A linear upper bound in extremal theory of sequences
- Combinatorial aspects of Davenport-Schinzel sequences
- Efficiency of a Good But Not Linear Set Union Algorithm
- Generalized Davenport-Schinzel sequences
- Generalized Davenport-Schinzel sequences with linear upper bound
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- On \(abab\)-free and \(abba\)-free set partitions
- On a problem of Davenport and Schinzel
- On geometric graphs with no k pairwise parallel edges
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
Cited in
(4)
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)
