scientific article; zbMATH DE number 3904630

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Random graphs (graph-theoretic aspects) (05C80) Graph theory (05Cxx)

Recommendations

scientific article; zbMATH DE number 18978
scientific article; zbMATH DE number 1231233
scientific article; zbMATH DE number 1540669
Random Graphs
scientific article; zbMATH DE number 5610906
scientific article; zbMATH DE number 3875330
scientific article; zbMATH DE number 863475
scientific article; zbMATH DE number 857026
scientific article; zbMATH DE number 1161245
The random graph

Cited in

(only showing first 100 items - show all)

An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution
The distribution of extremes in the degree sequence: A Gumbel distribution approach
Connected domination of regular graphs
An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm
Edge irregular total labellings for graphs of linear size
Rulers and slaves in a random social group
Strong uniform times and finite random walks
Poisson convergence and Poisson processes with applications to random graphs
A note on the edge-reconstruction of \(K_{1,m}\)-free graphs
Walk generating functions and spectral measures of infinite graphs
Edge-colouring random graphs
Modified binomial and Poisson distributions with applications in random mapping theory
On subspaces spanned by random selections of 1 vectors
Variations on the Ising problem
Asymptotic normality of graph statistics
Sorting in rounds
Approximate counting, uniform generation and rapidly mixing Markov chains
Patterns and invasions of evolutionarily stable strategies
Subgraph counts in random graphs using incomplete U-statistics methods
The linear arboricity of graphs
The isoperimetric number of random regular graphs
A new upper bound for the list chromatic number
Maximal induces trees in sparse random graphs
Triad count statistics
A graph property not satisfying a ``zero-one law
Three hundred million points suffice
Bipartite dimensions and bipartite degrees of graphs
Graphs without large triangle free subgraphs
Size and connectivity of the \(k\)-core of a random graph
Threshold functions for local properties of graphs: Triangles
Pancyclic Hamilton cycles in random graphs
On the largest strong components in m-out digraphs
On-line computation of minimal and maximal length paths
On the independence and chromatic numbers of random regular graphs
Kolmogorov complexity and random graphs
Expected parallel time and sequential space complexity of graph and digraph problems
The average parallel complexity of Cholesky factorization
Distanced graphs
On the number of maximum genus embeddings of almost all graphs
Infinitary logics and 0-1 laws
Matchings in random superpositions of bipartite trees
Convex hulls of dense balanced graphs
The construction of a set of recurrence which is not a set of strong recurrence
A linear time algorithm for graph partition problems
On small graphs with highly imperfect powers
Matching theory -- a sampler: From Dénes König to the present
Fuzzy graphs in the evaluation and optimization of networks
Analysis of minimal path routing schemes in the presence of faults
An optimal algorithm for generating minimal perfect hash functions
Thresholds for classes of intersection graphs
Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses
On large induced trees and long induced paths in sparse random graphs
Submaps of maps. I: General 0-1 laws
A Ramsey type problem concerning vertex colourings
Covering cubes by random half cubes, with applications to binary neural networks
On the density of subgraphs in a graph with bounded independence number
Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes
The parallel complexity of approximating the high degree subgraph problem
Coalescent random forests
Elements of a theory of computer simulation. I
Weak measure extension axioms
Tree and forest weights and their application to nonuniform random graphs
Limit theorems for a random graph epidemic model
On the connectivity of random subsets of projective spaces
Fuzzy retraction and folding of fuzzy-orientable compact manifold
The existence of exactly m-coloured complete subgraphs
Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs
Combinatorics and connectionism
Folding of fuzzy graphs and fuzzy spheres
A processor efficient MIS algorithm on random graphs
Random Ramsey graphs for the four-cycle
Extremal problems and generalized degrees
A probabilistic upper bound for the edge identification complexity of graphs
Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
Sparse matrix vector multiplication on distributed architectures: Lower bounds and average complexity results
The edge-forwarding index or orbital regular graphs
Heuristics for laying out information graphs
Finding a target subnetwork in sparse networks with random faults
A random clustering process
Hypergraphs and sharpened sieve inequalities
Listing graphs that satisfy first-order sentences
A new adaptive multi-start technique for combinatorial global optimizations
Phase transition phenomena in random discrete structures
Metric inference for social networks
Probabilistic models in cluster analysis
On an approximation measure founded on the links between optimization and polynomial approximation theory
Brownian excursions, critical random graphs and the multiplicative coalescent
Hypergraph colouring and the Lovász local lemma
A note on local colorings of graphs
Folding of fuzzy torus and fuzzy graphs
Epidemics in a population with social structures
Generic properties of combinatory maps: Neutral networks of RNA secondary structures
Almost perfect matchings in random uniform hypergraphs
The number of connected sparsely edged uniform hypergraphs
Tight approximations for resource constrained scheduling and bin packing
Random induced subgraphs of generalized \(n\)-cubes
Asymptotic enumeration of convex polygons
Constructive bounds for a Ramsey-type problem
The existence of uniquely \(-G\) colourable graphs
On some conjectures of Graffiti

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3682518)