We show a natural graph-theoretic generalization of the Sauer–Shelah lemma. This result is applied to bound the ‘∞ and L1 packing numbers of classes of functions whose range...
We present embeddings of generalized ladders as subgraphs into the hypercube. By embedding caterpillars into ladders, we obtain embeddings of caterpillars into the hypercube. In t...
Sergei L. Bezrukov, Burkhard Monien, Walter Unger,...
M-convex functions, introduced by Murota (1996, 1998), enjoy various desirable properties as “discrete convex functions.” In this paper, we propose two new polynomial-time sca...
We observe that a formula given by S. Negami [Trans. Amer. Math. Soc. 299 (1987), 601-622] for the Tutte polynomial of a k-sum of two graphs generalizes to a colored Tutte polynom...