Results 71 to 80 of about 5,903,622 (201)
On the number of series parallel and outerplanar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We show that the number $g_n$ of labelled series-parallel graphs on $n$ vertices is asymptotically $g_n \sim g \cdot n^{-5/2} \gamma^n n!$, where $\gamma$ and $g$ are explicit computable constants.
Manuel Bodirsky +3 more
doaj +1 more source
Ramsey Properties of Random Graphs and Folkman Numbers
Discussiones Mathematicae Graph Theory, 2017 For two graphs, G and F, and an integer r ≥ 2 we write G → (F)r if every r-coloring of the edges of G results in a monochromatic copy of F. In 1995, the first two authors established a threshold edge probability for the Ramsey property G(n, p) → (F)r ...
Rödl Vojtěch +2 more
doaj +1 more source
On limit distributions of vertex degrees in a configuration graph
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2015 The configuration graph where vertex degrees are independent identically distributed random variables is often used for models of complex networks such as the Internet. We consider a random graph consisting of N+1 vertices.
Irina Cheplyukova
doaj +1 more source
A Probabilistic Counting Lemma for Complete Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We prove the existence of many complete graphs in almost all sufficiently dense partitions obtained by an application of Szemerédi's Regularity Lemma.
Stefanie Gerke +2 more
doaj +1 more source
Asymptotics of m-Cliques in a Sparse Inhomogeneous Random Graph
Journal of Mathematics, 2022 One of the classical questions in random graph theory is to understand the asymptotics of subgraph counts. In inhomogeneous random graph, this question has not been well studied. In this study, we investigate the asymptotic distribution of m-cliques in a
Xiaofeng Zhao
doaj +1 more source
Central limit theorem for the principal eigenvalue and eigenvector of Chung–Lu random graphs
Journal of Physics: Complexity, 2023 A Chung–Lu random graph is an inhomogeneous Erdős–Rényi random graph in which vertices are assigned average degrees, and pairs of vertices are connected by an edge with a probability that is proportional to the product of their average degrees ...
Pierfrancesco Dionigi +4 more
doaj +1 more source
Limit theorems for the weights and the degrees in anN-interactions random graph model
Open Mathematics, 2016 A random graph evolution based on interactions of N vertices is studied. During the evolution both the preferential attachment rule and the uniform choice of vertices are allowed. The weight of an M-clique means the number of its interactions.
Fazekas István, Porvázsnyik Bettina
doaj +1 more source
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2010 Edges generation by random graph erdos-royi methods was needed high computation, it’s caused low performance. In fact, edge generation was used frequently with many nodes.
Zainal Abidin, Agus Zainal Arifin
doaj +1 more source
Super Connectivity of Erdős-Rényi Graphs
Mathematics, 2019 The super connectivity κ ′ ( G ) of a graph G is the minimum cardinality of vertices, if any, whose deletion results in a disconnected graph that contains no isolated vertex.
Yilun Shang
doaj +1 more source