Seth Pettie
Published 2014-01-22Version 1
We present new, and mostly sharp, bounds on the maximum length of certain generalizations of Davenport-Schinzel sequences. Among the results are sharp bounds on order-$s$ {\em double DS} sequences, for all $s$, sharp bounds on sequences avoiding {\em catenated permutations} (aka formation free sequences), and new lower bounds on sequences avoiding {\em zig-zagging} patterns.
Extremal problems for ordered (hyper)graphs: applications of Davenport-Schinzel sequences
New Representations of Matroids and Generalizations
Some new generalizations of Domination using restrictions on degrees of vertices
![QR code for arXiv:1401.5709 [math.CO]](http://oss.arxitics.com/images/favicon.svg)