Add to ORKGABSTRACT. A set E ⊆ Rn is s-straight for s> 0 if E has finite Method II outer s-measure equal to its Method I outer s-measure. If E is Method II s-measurable, this means E has finite Hausdorff s-measure equal to its Hausdorff s-content. The graph Γ of a convex function f: [a, b] → R is shown to be a countable union of 1-straight sets, and to contain a 1-straight set maximal in the sense that its Hausdorff 1-measure equals the diameter of Γ. 1. Introduction. In [7
We consider the disintegration of the Lebesgue measure on the graph of a convex function f : Rn \u21...
A Boolean function is called k-convex if for any pair x, y of its true points at Hamming distance at...
Path properties, such as 'geodesic', 'induced', 'all paths' define a convexity on a connected graph....
Let V be a finite set and a collection of subsets of V. Then is an alignment of V if and only if ...
The invisibility graph I(X) of a set X ⊆ Rd is a (possibly infinite) graph whose vertices are the po...
Let f ∈ C2 (R) satisfy f(0) = f 0 (0) = 0 and f 00(0) > 0. Then the 1-dimensional Hausdorff measure ...
Let f ∈ C2 (R) satisfy f(0) = f 0 (0) = 0 and f 00(0) > 0. Then the 1-dimensional Hausdorff measure ...
AbstractThe usual distance between pairs of vertices in a graph naturally gives rise to the notion o...
Let G = (V;E) be a graph without isolated vertices. A function f: V→[0; 1] is a total dominating fun...
In this dissertation we present complexity results related to the hull number and the convexity numb...
A Boolean function is called k-convex if for any pair x; y of its true points at Hamming distance at...
AbstractWe consider the disintegration of the Lebesgue measure on the graph of a convex function f:R...
A feasible family of paths in a connected graph G is a family that contains at least one path betwee...
In this piece of work, we start building some foundational theory about S−convexity (sets and points...
We consider the disintegration of the Lebesgue measure on the graph of a convex function f : Rn → R ...
We consider the disintegration of the Lebesgue measure on the graph of a convex function f : Rn \u21...
A Boolean function is called k-convex if for any pair x, y of its true points at Hamming distance at...
Path properties, such as 'geodesic', 'induced', 'all paths' define a convexity on a connected graph....
Let V be a finite set and a collection of subsets of V. Then is an alignment of V if and only if ...
The invisibility graph I(X) of a set X ⊆ Rd is a (possibly infinite) graph whose vertices are the po...
Let f ∈ C2 (R) satisfy f(0) = f 0 (0) = 0 and f 00(0) > 0. Then the 1-dimensional Hausdorff measure ...
Let f ∈ C2 (R) satisfy f(0) = f 0 (0) = 0 and f 00(0) > 0. Then the 1-dimensional Hausdorff measure ...
AbstractThe usual distance between pairs of vertices in a graph naturally gives rise to the notion o...
Let G = (V;E) be a graph without isolated vertices. A function f: V→[0; 1] is a total dominating fun...
In this dissertation we present complexity results related to the hull number and the convexity numb...
A Boolean function is called k-convex if for any pair x; y of its true points at Hamming distance at...
AbstractWe consider the disintegration of the Lebesgue measure on the graph of a convex function f:R...
A feasible family of paths in a connected graph G is a family that contains at least one path betwee...
In this piece of work, we start building some foundational theory about S−convexity (sets and points...
We consider the disintegration of the Lebesgue measure on the graph of a convex function f : Rn → R ...
We consider the disintegration of the Lebesgue measure on the graph of a convex function f : Rn \u21...
A Boolean function is called k-convex if for any pair x, y of its true points at Hamming distance at...
Path properties, such as 'geodesic', 'induced', 'all paths' define a convexity on a connected graph....