Skip to main content
×
Home
    • Aa
    • Aa

On Random Intersection Graphs: The Subgraph Problem

  • MICHAŁ KAROŃSKI (a1), EDWARD R. SCHEINERMAN (a2) and KAREN B. SINGER-COHEN (a3)
    • Published online: 01 January 1999
Abstract

A new model of random graphs – random intersection graphs – is introduced. In this model, vertices are assigned random subsets of a given set. Two vertices are adjacent provided their assigned sets intersect. We explore the evolution of random intersection graphs by studying thresholds for the appearance and disappearance of small induced subgraphs. An application to gate matrix circuit design is presented.

Copyright
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 26 *
Loading metrics...

Abstract views

Total abstract views: 89 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 23rd June 2017. This data will be updated every 24 hours.

Errata