arXiv (All)
open access
Subgraph probabilities in random intersection graphs
Since their introduction by Karoński, Scheinerman, and Singer-Cohen in 90's, random intersection graphs have attracted much attention, mostly due to their various applications. In this article, we establish a general result for the probability that a given small subgraph is present in a random inter
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Intersections of Directed Graphs#1050273
- Random bipartite graphs with i.i.d. weights and applications to inhomogeneous random intersection graphs#1130446
- Network Discovery and Selection Problem#420315
- Random algebraic constructions for extremal and Ramsey problems#1052031
- Enumeration of regular multipartite hypergraphs#1049618
Record · ID 1402505
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive