Asymptotic enumeration of labeled series-parallel $k$-cyclic bridgeless graphs

2021 ◽  
Vol 28 (4) ◽  
pp. 61-69
Author(s):  
V. A. Voblyi
Keyword(s):  
Asymptotic Enumeration

scholarly journals Compositions into Powers of b: Asymptotic Enumeration and Parameters

Algorithmica ◽  
2015 ◽  
Vol 75 (4) ◽  
pp. 606-631 ◽  
Author(s):  
Daniel Krenn ◽  
Stephan Wagner
Keyword(s):  
Asymptotic Enumeration

scholarly journals Asymptotic Enumeration of Tournaments with a Given Score Sequence

1996 ◽  
Vol 73 (1) ◽  
pp. 77-90 ◽  
Author(s):  
Brendan D. McKay ◽  
Xiaoji Wang
Keyword(s):  
Asymptotic Enumeration

scholarly journals A bijection for nonorientable general maps

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Jérémie Bettinelli
Keyword(s):  
Simple Form ◽  
Asymptotic Enumeration ◽  
International Audience ◽  
Enumeration Formula

International audience We give a different presentation of a recent bijection due to Chapuy and Dołe ̨ga for nonorientable bipartite quadrangulations and we extend it to the case of nonorientable general maps. This can be seen as a Bouttier–Di Francesco–Guitter-like generalization of the Cori–Vauquelin–Schaeffer bijection in the context of general nonori- entable surfaces. In the particular case of triangulations, the encoding objects take a particularly simple form and we recover a famous asymptotic enumeration formula found by Gao.

scholarly journals Asymptotic enumeration of incidence matrices

2006 ◽  
Vol 42 ◽  
pp. 59-70 ◽  
Author(s):  
Peter Cameron ◽  
Thomas Prellberg ◽  
Dudley Stark
Keyword(s):  
Asymptotic Enumeration ◽  
Incidence Matrices

scholarly journals Complex martingales and asymptotic enumeration

2017 ◽  
Vol 52 (4) ◽  
pp. 617-661 ◽  
Author(s):  
Mikhail Isaev ◽  
Brendan D. McKay
Keyword(s):  
Asymptotic Enumeration

Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting

2013 ◽  
Vol 22 (5) ◽  
pp. 783-799 ◽  
Author(s):  
GUILLEM PERARNAU ◽  
ORIOL SERRA
Keyword(s):  
Bipartite Graph ◽  
High Probability ◽  
Perfect Matching ◽  
Complete Bipartite Graph ◽  
Bipartite Graphs ◽  
Perfect Matchings ◽  
Asymptotic Enumeration ◽  
Complete Bipartite Graphs ◽  
Edge Colourings ◽  
Square Matrix

A perfect matchingMin an edge-coloured complete bipartite graphKn,nis rainbow if no pair of edges inMhave the same colour. We obtain asymptotic enumeration results for the number of rainbow perfect matchings in terms of the maximum number of occurrences of each colour. We also consider two natural models of random edge-colourings ofKn,nand show that if the number of colours is at leastn, then there is with high probability a rainbow perfect matching. This in particular shows that almost every square matrix of ordernin which every entry appearsntimes has a Latin transversal.

scholarly journals Asymptotic enumeration and limit laws for graphs of fixed genus

2011 ◽  
Vol 118 (3) ◽  
pp. 748-777 ◽  
Author(s):  
Guillaume Chapuy ◽  
Éric Fusy ◽  
Omer Giménez ◽  
Bojan Mohar ◽  
Marc Noy
Keyword(s):  
Asymptotic Enumeration ◽  
Limit Laws ◽  
Fixed Genus
Sign in / Sign up

Export Citation Format

Share Document