Displaying similar documents to “Generalized Davenport-Schinzel sequences: Results, problems, and applications.”

The non-crossing graph.

Linial, Nathan, Saks, Michael, Statter, David (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A note on tree realizations of matrices

Alain Hertz, Sacha Varone (2007)

RAIRO - Operations Research

Similarity:

It is well known that each tree metric has a unique realization as a tree, and that this realization minimizes the total length of the edges among all other realizations of . We extend this result to the class of symmetric matrices with zero diagonal, positive entries, and such that for all distinct .

On Monochromatic Subgraphs of Edge-Colored Complete Graphs

Eric Andrews, Futaba Fujie, Kyle Kolasinski, Chira Lumduanhom, Adam Yusko (2014)

Discussiones Mathematicae Graph Theory

Similarity:

In a red-blue coloring of a nonempty graph, every edge is colored red or blue. If the resulting edge-colored graph contains a nonempty subgraph G without isolated vertices every edge of which is colored the same, then G is said to be monochromatic. For two nonempty graphs G and H without isolated vertices, the mono- chromatic Ramsey number mr(G,H) of G and H is the minimum integer n such that every red-blue coloring of Kn results in a monochromatic G or a monochromatic H. Thus, the standard...

Increasing integer sequences and Goldbach's conjecture

Mauro Torelli (2006)

RAIRO - Theoretical Informatics and Applications

Similarity:

Increasing integer sequences include many instances of interesting sequences and combinatorial structures, ranging from tournaments to addition chains, from permutations to sequences having the that any integer greater than 1 can be obtained as the sum of two elements in the sequence. The paper introduces and compares several of these classes of sequences, discussing recurrence relations, enumerative problems and questions concerning shortest sequences.