Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-23T10:12:43.245Z Has data issue: false hasContentIssue false
  • English
  • Français

On Random Intersection Graphs: The Subgraph Problem

Published online by Cambridge University Press:  01 January 1999

MICHAŁ KAROŃSKI ,
EDWARD R. SCHEINERMAN  and
KAREN B. SINGER-COHEN
MICHAŁ KAROŃSKI
Affiliation:
Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznán, Poland and Department of Mathematics and Computer Science, Emory University, Atlanta, GA 30322, USA (e-mail: [email protected] and [email protected])
EDWARD R. SCHEINERMAN
Affiliation:
Department of Mathematical Sciences, The Johns Hopkins University, Baltimore, MD 21218–2689, USA (e-mail: [email protected])
KAREN B. SINGER-COHEN
Affiliation:
Department of Mathematical Sciences, The Johns Hopkins University, Baltimore, MD 21218–2689, USA and School of Mathematics, University of Minnesota, Minneapolis, MN 55455, USA (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

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.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 8 , Issue 1-2 , January 1999 , pp. 131 - 159
Copyright
© 1999 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)