32 citations
- Institut national de recherche en sciences et technologies du numériqueFR11 papers
- Geometric (India)IN3 papers
- Orange (France)FR3 papers
- Centre National de la Recherche ScientifiqueFR2 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR2 papers
- Laboratoire de Mathématiques de VersaillesFR2 papers
- Laboratoire d'Informatique Algorithmique: Fondements et ApplicationsFR2 papers
- Nantes UniversitéFR2 papers
- Association for Symbolic LogicUS1 paper
- Ben-Gurion University of the NegevIL1 paper
- CEA Paris-SaclayFR1 paper
- Center for Responsible TravelUS1 paper
5 papers · 1 filter
5-choosability of graphs with 2 crossings
Victor Campos, Frédéric Havet
We show that every graph with two crossings is 5-choosable. We also prove that every graph which can be made planar by removing one edge is 5-choosable.
Automatic Classification of Restricted Lattice Walks
Alin Bostan, Manuel Kauers
We propose an experimental mathematics approach leading to the computer-driven discovery of various structural properties of general counting functions coming from enumeration of w…
New bijective links on planar maps via orientations
Eric Fusy
This article presents new bijections on planar maps. At first a bijection is established between bipolar orientations on planar maps and specific "transversal structures" on triang…
The height of random binary unlabelled trees
Nicolas Broutin, Philippe Flajolet
This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size is…
A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics
Philippe Flajolet, Eric Fusy, Xavier Gourdon +2
A ``hybrid method'', dedicated to asymptotic coefficient extraction in combinatorial generating functions, is presented, which combines Darboux's method and singularity analysis th…