18 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Centre National de la Recherche ScientifiqueFR9 papers
- Université de MontréalCA6 papers
- Centre de recherches mathématiquesCA5 papers
- Université Paris DiderotFR4 papers
- Institut Denis PoissonFR3 papers
- Institut de Recherche en Informatique FondamentaleFR3 papers
- Laboratoire d'Informatique Algorithmique: Fondements et ApplicationsFR3 papers
- Université de ToursFR3 papers
- Université d'OrléansFR3 papers
- Laboratoire de Mathématiques Blaise PascalFR2 papers
- Laboratoire de Mathématiques de ReimsFR2 papers
- Université de Reims Champagne-ArdenneFR2 papers
5 papers · 1 filter
Bivariate -polynomial association schemes
P. -A. Bernard, N. Crampe, L. Poulain d'Andecy +2
Bivariate P-polynomial association scheme of type are defined as a generalization of the P-polynomial association schemes. This generalization is shown to be equivalent to…
A description of the Zeta map on Dyck paths area sequences
Viviane Pons
We give a description of the well known Zeta map on Dyck paths which sends the dinv,area statistics to the area,bounce statistics. Our description uses Dyck paths area sequences an…
Local convergence and stability of tight bridge-addable graph classes
Guillaume Chapuy, Guillem Perarnau
A class of graphs is bridge-addable if given a graph in the class, any graph obtained by adding an edge between two connected components of is also in the class. The author…
Laplacian matrices and spanning trees of tree graphs
Philippe Biane, Guillaume Chapuy
If is a strongly connected finite directed graph, the set of rooted directed spanning trees of is naturally equipped with a structure of directed graph: ther…
Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture
Guillaume Chapuy, Guillem Perarnau
A class of graphs is bridge-addable if given a graph in the class, any graph obtained by adding an edge between two connected components of is also in the class. We prove a…