Currently displaying 1 – 20 of 45

Showing per page

Order by Relevance | Title | Year of publication

Combinatorics and quantifiers

Jaroslav Nešetřil — 1996

Commentationes Mathematicae Universitatis Carolinae

Let I m be the set of subsets of I of cardinality m . Let f be a coloring of I m and g a coloring of I m . We write f → g if every f -homogeneous H ⊆ I is also g -homogeneous. The least m such that f → g for some f : I m → k is called the of g and denoted by w k ( g ) . In the first part of the paper we prove the existence of colorings with high k -width. In particular, we show that for each k > 0 and m > 0 there is a coloring g with w k ( g ) = m . In the second part of the paper we give applications of wide colorings in the theory of generalized quantifiers....

A few remarks on the history of MST-problem

Jaroslav Nešetřil — 1997

Archivum Mathematicum

On the background of Borůvka’s pioneering work we present a survey of the development related to the Minimum Spanning Tree Problem. We also complement the historical paper Graham-Hell [GH] by a few remarks and provide an update of the extensive literature devoted to this problem.

Page 1 Next

Download Results (CSV)