activity
20082026
most citedCounting genus one partitions and permutations

11 citations · 11 across the 10 of their papers we have counts for

collaborators

12 papers

math.CO2026

Hypermaps with hyperedges of length at most

Robert Cori, Gábor Hetyei

We study the computation of our recently introduced Whitney polynomial and the enumeration of the spanning hypertrees for hypermaps whose hyperedges have length at most . This i…

math.CO2024

On reduced unicellular hypermonopoles

Robert Cori, Gábor Hetyei

The problem of counting unicellular hypermonopoles by the number of their hyperedges is equivalent to describing the cycle length distribution of a product of two circular permutat…

math.CO2023

A Whitney polynomial for hypermaps

Robert Cori, Gábor Hetyei

We introduce a Whitney polynomial for hypermaps and use it to generalize the results connecting the circuit partition polynomial to the Martin polynomial and the results on several…

math.CO2022

A few words about maps

Robert Cori, Yiting Jiang, Patrice Ossona de Mendez +1

In this paper, we survey some properties, encoding, and bijections involving combinatorial maps, double occurrence words, and chord diagrams. We particularly study quasi-trees from…

math.CO2021

Spanning hypertrees, vertex tours and meanders

Robert Cori, Gábor Hetyei

This paper revisits the notion of a spanning hypertree of a hypermap introduced by one of its authors and shows that it allows to shed new light on a very diverse set of recent res…

math.CO2017

Counting partitions of a fixed genus

Robert Cori, Gábor Hetyei

We show that, for any fixed genus , the ordinary generating function for the genus partitions of an -element set into blocks is algebraic. The proof involves showing…