28 citations · 31 across the 6 of their papers we have counts for
8 papers
Bounding the tripartite-circle crossing number of complete tripartite graphs
Charles Camacho, Silvia Fernández-Merchant, Marija Jelić Milutinović +4
A tripartite-circle drawing of a tripartite graph is a drawing in the plane, where each part of a vertex partition is placed on one of three disjoint circles, and the edges do not…
Book crossing numbers of the complete graph and small local convex crossing numbers
Bernardo M. Ábrego, Julia Dandurand, Silvia Fernández-Merchant +2
A -page book drawing of a graph is a drawing of on halfplanes with common boundary , a line, where the vertices are on and the edges cannot cross…
Bishellable drawings of
Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant +6
The Harary--Hill conjecture, still open after more than 50 years, asserts that the crossing number of the complete graph is $ H(n) = \frac 1 4 \left\lfloor\frac{\mathstrut n}…
On the maximum number of isosceles right triangles in a finite point set
Bernardo M. Ábrego, Silvia Fernández-Merchant, David B. Roberts
Let be a finite set of points in the plane. For any set of points in the plane, denotes the number of similar copies of contained in . For a fixed , Er…
Point-sets in general position with many similar copies of a pattern
Bernardo M. Ábrego, Silvia Fernández-Merchant
For every pattern , consisting of a finite set of points in the plane, is defined as the largest number of similar copies of among sets of points in the pla…
An inequality for Kruskal-Macaulay functions
Bernardo M. Ábrego, Silvia Fernández-Merchant, Bernardo Llano
Given integers and , there is a unique way of writing as so that …