scientific article; zbMATH DE number 747040

zbMATH Open0817.05057MaRDI QIDQ4697461FDOQ4697461

Tomasz Łuczak

Publication date: 11 July 1995

Title of this publication is not available (Why is that?)

zbMATH Keywords

probabilitydegree sequencerandom graph processisolated cycleslarge component

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cited In (32)

• The densest subgraph problem in sparse random graphs
• New approximations for network reliability
• A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three
• Title not available (Why is that?)
• Multilayer brain networks
• Sparse quasi-random graphs
• Phase transitions in graphs on orientable surfaces
• On the robustness of random \(k\)-cores
• Push is Fast on Sparse Random Graphs
• Geometry of the minimal spanning tree of a random 3-regular graph
• MAX \(\kappa\)-cut and the inhomogeneous Potts spin Glass
• Counting connected graphs inside-out
• On a surface formed by randomly gluing together polygonal discs
• The Stripping Process Can be Slow: Part II
• Applications of the variance of final outbreak size for disease spreading in networks
• The evolution of the min-min random graph process
• Building a random network with a given expected giant component
• Fuzzy clustering with Barber modularity regularization
• A critical point for random graphs with a given degree sequence
• Asymptotic enumeration of sparse graphs with a minimum degree constraint
• Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
• Mixing times of random walks on dynamic configuration models
• On resilience of connectivity in the evolution of random graphs
• The phase transition in inhomogeneous random graphs
• Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity
• Core forging and local limit theorems for the \(k\)-core of random graphs
• Counting sparse \(k\)-edge-connected hypergraphs with given number of vertices and edges
• Critical Window for Connectivity in the Configuration Model
• Loose cores and cycles in random hypergraphs
• Random graphs of binomial type with sparsely-edged initial graphs
• How to determine if a random graph with a fixed degree sequence has a giant component
• Percolation on Sparse Random Graphs with Given Degree Sequence

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 Q4697461)