On giant components and treewidth in the layers model
From MaRDI portal
Publication:2811162
DOI10.1002/rsa.20597zbMath1338.05247arXiv1401.6681OpenAlexW3102409779MaRDI QIDQ2811162
Daniel Reichman, Jonathan Hermon
Publication date: 10 June 2016
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.6681
Random graphs (graph-theoretic aspects) (05C80) Permutations, words, matrices (05A05) Vertex degrees (05C07)
Related Items (1)
Cites Work
- Unnamed Item
- Combinatorial model and bounds for target set selection
- Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs
- New bounds for contagious sets
- On percolation in random graphs with given vertex degrees
- The asymptotic number of labeled graphs with given degree sequences
- Treewidth. Computations and approximations
- Sharpness of the phase transition in percolation models
- Surface order large deviations for high-density percolation
- On the tree-depth of random graphs
- The phase transition in random graphs: A simple proof
- Rank-width of random graphs
- The mixing time of the giant component of a random graph
- Recoverable Values for Independent Sets
- On the critical percolation probabilities
- Percolation
- A critical point for random graphs with a given degree sequence
- Decycling numbers of random regular graphs
- A new lower bound for the critical probability of site percolation on the square lattice
- A Note on Treewidth in Random Graphs
- Percolation on Sparse Random Graphs with Given Degree Sequence
This page was built for publication: On giant components and treewidth in the layers model
