1 citations · 1 across the 5 of their papers we have counts for
9 papers
-arrangements of pseudolines and pseudocircles
Jan Kynčl, Carolina Medina, Gelasio Salazar
A -arrangement of pseudolines is a set of bi-infinite curves in the plane such that any two of them intersect each other in exactly points, at which they cross, and it is si…
Positive links with arrangements of pseudocircles as shadows
Carolina Medina, Santino Ramirez, Jorge L. Ramirez-Alfonsin +1
An arrangement of pseudocircles is a collection of Jordan curves in the plane that pairwise intersect (transversally) at exactly two points. How many non-equivalent l…
Well-quasi-order of plane minors and an application to link diagrams
Carolina Medina, Bojan Mohar, Gelasio Salazar
A plane graph is a {\em plane minor} of a plane graph if there is a sequence of vertex and edge deletions, and edge contractions performed on the plane, that takes to $…
When can a link be obtained from another using crossing exchanges and smoothings?
Carolina Medina, Gelasio Salazar
Let be a fixed link. Given a link diagram , is there a sequence of crossing exchanges and smoothings on that yields a diagram of ? We approach this problem from the c…
The knots that lie above all shadows
Carolina Medina, Gelasio Salazar
We show that for each even integer , every reduced shadow with sufficiently many crossings is a shadow of a torus knot T(2,m+1), or of a twist knot , or of a connected…
The unavoidable arrangements of pseudocircles
Carolina Medina, Jorge Ramírez-Alfonsín, Gelasio Salazar
It is known that cyclic arrangements are the only {\em unavoidable} simple arrangements of pseudolines: for each fixed , every sufficiently large simple arrangement of pseu…
On the number of unknot diagrams
Carolina Medina, Jorge Ramírez-Alfonsín, Gelasio Salazar
Let be a knot diagram, and let denote the set of diagrams that can be obtained from by crossing exchanges. If has crossings, then cons…
The complexity of computing the cylindrical and the -circle crossing number of a graph
Frank Duque, Hernán González-Aguilar, César Hernández-Vélez +2
A plane drawing of a graph is {\em cylindrical} if there exist two concentric circles that contain all the vertices of the graph, and no edge intersects (other than at its endpoint…
Embeddability of arrangements of pseudocircles and graphs on surfaces
Éric Colin de Verdière, Carolina Medina, Edgardo Roldán-Pensado +1
A pseudocircle is a simple closed curve on some surface; an arrangement of pseudocircles is a collection of pseudocircles that pairwise intersect in exactly two points, at which th…