Search Constraints
Search Results

ArticleLeanos, JesusRecently, Aichholzer, García, Orden, and Ramos derived a remarkably improved lower bound for the number of (⩽k)edges in an npoint set, and as an immediate corollary, an improved lower bound on the rectilinear crossing number of Kn. We use simple all . . .

ArticleFernandez, SilviaLet G(v,δ) be the set of all δregular graphs on v vertices. Certain graphs from among those in G(v,δ) with maximum girth have a special property called traceminimality. In particular, all strongly regular graphs with no triangles and some cages are . . .

ArticleAbrego, BernardoDevadoss asked: (1) can every polygon be convexified so that no internal visibility (between vertices) is lost in the process? Moreover, (2) does such a convexification exist, in which exactly one vertex is moved at a time (that is, using singleverte . . .

ArticleAbrego, Bernardo"Consider a kelement subset P of the plane. It is known that the maximum number of sets similar to P that can be found among n points in the plane is Θ(n2) if and only if the cross ratio of any quadruplet of points in P is algebraic [3], [9]. In this . . .

ArticleFernandez, SilviaLet f(n) be the maximum number of unit distances determined by the vertices of a convex n gon. Erdos and Moser conjectured that this function is linear. Supporting this conjecture we prove that f sym (n) ∼∼ 2n where f sym (n) is the restriction of f( . . .

ArticleAbrego, BernardoLet P be a set of points in general position in the plane. Join all pairs of points in P with straight line segments. The number of segmentcrossings in such a drawing, denoted by cr(P) , is the rectilinear crossing number of P. A halving line of P is . . .

ArticleKirzner, Jonathan D.Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straightline segment if they satisfy some prescribed proximity rule. We consider four classes of higher order proximity graphs, n . . .

ArticleFernandez, SilviaWe give a new lower bound for the rectilinear crossing number of the complete geometric graph K n . We prove that and we extend the proof of the result to pseudolinear drawings of K n .

ArticlePap, J.M.Physical understanding of total and spectral solar irradiance variation depends upon establishing a connection between the temporal variability of spatially resolved solar structures and spacecraft observations of irradiance. One difficulty in compari . . .

ArticleSaumell, MariaResistance to heavy metals is important for the survival of bacteria in contaminated environments. In this study, we show that the unicellular cyanobacterial species Synechococcus sp. IU 625 adapts to growth in the presence of mercuric chloride, recov . . .