On the Expansion of the Giant Component in Percolated (n, d, lambda) Graphs

Eran Ofek. On the Expansion of the Giant Component in Percolated (n, d, lambda) Graphs. Combinatorics, Probability & Computing, 16(3):445-457, 2007. [doi]

@article{Ofek07,
  title = {On the Expansion of the Giant Component in Percolated (n, d, lambda) Graphs},
  author = {Eran Ofek},
  year = {2007},
  doi = {10.1017/S0963548306008182},
  url = {http://dx.doi.org/10.1017/S0963548306008182},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Ofek07},
  cites = {0},
  citedby = {0},
  journal = {Combinatorics, Probability & Computing},
  volume = {16},
  number = {3},
  pages = {445-457},
}