scientific article
From MaRDI portal
Publication:3715148
zbMath0588.05040MaRDI QIDQ3715148
Béla Bollobás, Andrew G. Thomason
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)
Related Items (39)
The symmetry in the martingale inequality ⋮ Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs ⋮ On the order of the largest induced tree in a random graph ⋮ Threshold and hitting time for high-order connectedness in random hypergraphs ⋮ Maximum generic nullity of a graph ⋮ Evolution of high-order connected components in random hypergraphs ⋮ Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks ⋮ Phase transition in cohomology groups of non-uniform random simplicial complexes ⋮ Connectivity of the linear uniform hypergraph process ⋮ Solution methods and computational investigations for the linear bottleneck assignment problem ⋮ Perfect fractional matchings in \(k\)-out hypergraphs ⋮ On resilience of connectivity in the evolution of random graphs ⋮ The random linear bottleneck assignment problem ⋮ Algebraic and combinatorial expansion in random simplicial complexes ⋮ ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs ⋮ Sharp threshold for rigidity of random graphs ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Concentration of rainbow \(k\)-connectivity of a multiplex random graph ⋮ Integral homology of random simplicial complexes ⋮ Computational study of the US stock market evolution: a rank correlation-based network model ⋮ Asymptotics for Shamir's problem ⋮ Survival time of a random graph ⋮ Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing ⋮ Evolution of a modified binomial random graph by agglomeration ⋮ Asymptotically optimal induced universal graphs ⋮ The chromatic number of random graphs ⋮ A new \textsf{DSATUR}-based algorithm for exact vertex coloring ⋮ Expected values of parameters associated with the minimum rank of a graph ⋮ Integer sets with prescribed pairwise differences being distinct ⋮ Using tabu search techniques for graph coloring ⋮ The sharp threshold for jigsaw percolation in random graphs ⋮ Random graph's Hamiltonicity is strongly tied to its minimum degree ⋮ STABULUS: A technique for finding stable sets in large graphs with tabu search ⋮ The Kőnig graph process ⋮ Vanishing of cohomology groups of random simplicial complexes ⋮ On the connectivity of random subsets of projective spaces ⋮ Turán's theorem and maximal degrees ⋮ On the strength of connectedness of a random hypergraph ⋮ Hitting times for Shamir’s problem
This page was built for publication:
