Geodesic
Split graphs: combinatorial species and asymptotics
Justin M. Troyka1
1York University
The electronic journal of combinatorics, Tome 26 (2019) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A split graph is a graph whose vertices can be partitioned into a clique and a stable set. We investigate the combinatorial species of split graphs, providing species-theoretic generalizations of enumerative results due to Bína and Přibil (2015), Cheng, Collins, and Trenk (2016), and Collins and Trenk (2018). In both the labeled and unlabeled cases, we give asymptotic results on the number of split graphs, of unbalanced split graphs, and of bicolored graphs, including proving the conjecture of Cheng, Collins, and Trenk (2016) that almost all split graphs are balanced.
DOI : 10.37236/8278
Classification : 05C70, 05C30, 05A15, 05A16

Justin M. Troyka  1

1 York University 
@article{10_37236_8278,
     author = {Justin M. Troyka},
     title = {Split graphs: combinatorial species and asymptotics},
     journal = {The electronic journal of combinatorics},
     year = {2019},
     volume = {26},
     number = {2},
     doi = {10.37236/8278},
     zbl = {1416.05235},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/8278/}
}
TY  - JOUR
AU  - Justin M. Troyka
TI  - Split graphs: combinatorial species and asymptotics
JO  - The electronic journal of combinatorics
PY  - 2019
VL  - 26
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/8278/
DO  - 10.37236/8278
ID  - 10_37236_8278
ER  - 
%0 Journal Article
%A Justin M. Troyka
%T Split graphs: combinatorial species and asymptotics
%J The electronic journal of combinatorics
%D 2019
%V 26
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/8278/
%R 10.37236/8278
%F 10_37236_8278
Justin M. Troyka. Split graphs: combinatorial species and asymptotics. The electronic journal of combinatorics, Tome 26 (2019) no. 2. doi: 10.37236/8278

Cité par Sources :