Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs

@inproceedings{Naor2005EfficientlyCH,
  title={Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs},
  author={Moni Naor and Asaf Nussboim and Eran Tromer},
  booktitle={TCC},
  year={2005}
}
We construct efficiently computable sequences of randomlooking graphs that preserve properties of the canonical random graphs G(2, p(n)). We focus on first-order graph properties, namely properties that can be expressed by a formula φ in the language where variables stand for vertices and the only relations are equality and adjacency (e.g. having an isolated vertex is a first-order property ∃x∀y(¬edge(x, y))). Random graphs are known to have remarkable structure w.r.t. first order properties… CONTINUE READING
6 Citations
22 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-6 of 6 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Huge Pseudo-Random Graphs that Preserve Global Properties of Random Graphs

  • A. Nussboim
  • M.Sc. Thesis,
  • 2003
Highly Influential
4 Excerpts

The Strange Logic of Random Graphs

  • J. H. Spencer
  • Springer Verlag,
  • 2001
Highly Influential
3 Excerpts

and J

  • N. Alo
  • H. Spencer, The Probabilistic Method, John Wiley…
  • 1992
1 Excerpt

Carmichael’s Lambda Function, Acta Arithmetica, vol

  • P. Erdös, C. Pomerance, E. Schmutz
  • 58, 363-385,
  • 1991

An Application of Games to the Completeness Problem for Formalized Theories

  • A. Ehrenfeucht
  • Quasi - random graphs , Combinatorica
  • 1989

Quasi-random graphs, Combinatorica, vol

  • F.R.K. Chung, R. L. Graham, R. M. Wilson
  • 9, 345–362,
  • 1989
2 Excerpts

Similar Papers

Loading similar papers…