activity
20132025
most citedMatroid basis graph: Counting Hamiltonian cycles

1 citations · 1 across the 5 of their papers we have counts for

collaborators

7 papers

math.AC2025

Numerical semigroup tree: type-representation

Jonathan Chappelon, Jorge L. Ramírez Alfonsín, Dumitru I. Stamate

In this paper, we introduce a new depicting of the so-called numerical semigroup tree . By exploring computationally this improved picture, relying on the type notion o…

math.CO2025

Matroids, intersecting bases, and Borsuk property

Gyivan López-Campos, Frédéric Meunier, Jorge L. Ramírez Alfonsín

A subset of has the Borsuk property if it can be decomposed into at most parts of diameter smaller than . This is an important geometric property, inspir…

math.CO2020

Ball packings for links

Jorge Luis Ramírez Alfonsín, Ivan Rasskin

The ball number of a link , denoted by , is the minimum number of solid balls (not necessarily of the same size) needed to realize a necklace representing . In this…

math.CO2020

Self-dual Maps I : antipodality

Luis Montejano, Jorge L. Ramírez Alfonsín, Ivan Rasskin

A self-dual map is said to be \emph{antipodally self-dual} if the dual map is antipodal embedded in with respect to . In this paper, we investigate nece…

math.CO2016★ 1 cited

Matroid basis graph: Counting Hamiltonian cycles

Cristina G. Fernandes, César Hernández-Vélez, José C. de Pina +1

We present exponential and super factorial lower bounds on the number of Hamiltonian cycles passing through any edge of the basis graphs of a graphic, generalized Catalan and unifo…

math.AC2016

Numerical semigroups II: pseudo-symmetric AA-Semigroups

Ignacio García-Marco, Jorge L. Ramírez Alfonsín, Oystein J. Rodseth

This paper is a continuation of the paper "Numerical Semigroups: Apéry Sets and Hilbert Series". We consider the general numerical AA-semigroup, i.e., semigroups consisting of all…

math.CO2013

Ramsey for complete graphs with dropped cliques

Jonathan Chappelon, Luis Pedro Montejano, Jorge Luis Ramírez Alfonsín

Let be the complete graph on vertices from which a set of edges, induced by a clique of order , has been dropped. In this note we give two explicit upper bounds…