Pendant appearances and components in random graphs from structured classes

IF 1 3区数学 Q1 MATHEMATICS

European Journal of Combinatorics Pub Date : 2024-05-31 DOI:10.1016/j.ejc.2024.103994

Colin McDiarmid

引用次数: 0

Abstract

We consider random graphs sampled uniformly from a structured class of graphs, such as the class of graphs embeddable in a given surface. We sharpen earlier results on pendant appearances, concerning for example numbers of leaves, and we find the asymptotic distribution of components other than the giant component, under quite general conditions.

查看原文本刊更多论文

来自结构类的随机图中的悬挂外观和组件

我们考虑从一类结构化图形（如可嵌入给定曲面的图形）中均匀采样的随机图形。我们进一步完善了早先关于挂件外观的结果，例如关于叶片数的结果，并在相当普遍的条件下找到了巨型分量以外的其他分量的渐近分布。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

European Journal of Combinatorics 数学-数学

CiteScore

2.10

自引率

10.00%

发文量

124

审稿时长

4-8 weeks

期刊介绍： The European Journal of Combinatorics is a high standard, international, bimonthly journal of pure mathematics, specializing in theories arising from combinatorial problems. The journal is primarily open to papers dealing with mathematical structures within combinatorics and/or establishing direct links between combinatorics and other branches of mathematics and the theories of computing. The journal includes full-length research papers on important topics.