On Random Intersection Graphs: The Subgraph Problem

DOI10.1017/S0963548398003459zbMATH Open0924.05059OpenAlexW2165064763MaRDI QIDQ4243076FDOQ4243076

Authors: Michal Karonski, Karen B. Singer-Cohen, Edward Scheinerman 

Publication date: 11 May 1999

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548398003459

Recommendations

• Random subcube intersection graphs. I: Cliques and covering
• On small subgraphs in a random intersection digraph
• scientific article; zbMATH DE number 3943865
• Random graphs and their subgraphs
• On Some Combinatorial Properties of Random Intersection Graphs
• scientific article; zbMATH DE number 3333197
• Publication:4729111
• The intersection graph of random sets
• On Subgraph Sizes in Random Graphs
• Subgraphs of Random Graphs

zbMATH Keywords

evolutioninduced subgraphrandom intersection graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (80)

• The number of triangles in random intersection graphs
• Networks beyond pairwise interactions: structure and dynamics
• On local weak limit and subgraph counts for sparse random graphs
• Expander properties and the cover time of random intersection graphs
• Degree distribution of an inhomogeneous random intersection graph
• Degree-degree distribution in a power law random intersection graph with clustering
• Colouring Non-sparse Random Intersection Graphs
• A random intersection digraph: indegree and outdegree distributions
• Recent advances on the Hamiltonian problem: survey III
• Selected Combinatorial Properties of Random Intersection Graphs
• The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs
• Efficiently covering complex networks with cliques of similar vertices
• Degree distribution of a typical vertex in a general random intersection graph
• Isoperimetric numbers of randomly perturbed intersection graphs
• On Some Combinatorial Properties of Random Intersection Graphs
• On the chromatic index of random uniform hypergraphs
• A note on the vertex degree distribution of random intersection graphs
• A new family of proximity graphs: class cover catch digraphs
• On small subgraphs in a random intersection digraph
• Poisson approximation of induced subgraph counts in an inhomogeneous random intersection graph model
• Joint probability generating function for degrees of active/passive random intersection graphs
• Recognizing random intersection graphs
• Perfect matchings in random intersection graphs
• Degree and clustering coefficient in sparse random intersection graphs
• Edge exchangeable models for interaction networks
• Central limit theorem for the largest component of random intersection graph
• Constructions of independent sets in random intersection graphs
• Component evolution in a secure wireless sensor network
• Random subcube intersection graphs. I: Cliques and covering
• Large cliques in sparse random intersection graphs
• The degree of a typical vertex in generalized random intersection graph models
• Large independent sets in general random intersection graphs
• On the independence number and Hamiltonicity of uniform random intersection graphs
• Phase transitions for detecting latent geometry in random graphs
• Random intersection graphs with communities
• The shortest distance in random multi-type intersection graphs
• Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs
• Sets that are connected in two random graphs
• Two Models of Random Intersection Graphs and their Applications
• The intersection graph of random sets
• Epidemics on Random Graphs with Tunable Clustering
• The Vertex Degree Distribution of Passive Random Intersection Graph Models
• Random intersection graph process
• On the distribution of the domination number for random class cover catch digraphs
• RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
• A note on hamiltonicity of uniform random intersection graphs
• On the kernel size of clique cover reductions for random intersection graphs
• Poisson approximation of the number of cliques in random intersection graphs
• On the typical case complexity of graph optimization
• Turán and Ramsey properties of subcube intersection graphs
• Scale-free network clustering in hyperbolic and other random graphs
• Size of the largest component in a critical graph
• Interval graph limits
• Predicting unobserved links in incompletely observed networks
• The largest component in critical random intersection graphs
• SIR epidemics and vaccination on random graphs with clustering
• Epidemics on random intersection graphs
• Diameter, connectivity, and phase transition of the uniform random intersection graph
• On the chromatic number of non-sparse random intersection graphs
• The chromatic number of random intersection graphs
• On the isolated vertices and connectivity in random intersection graphs
• Sharp thresholds for Hamiltonicity in random intersection graphs
• Maximum cliques in graphs with small intersection number and random intersection graphs
• The coupling method for inhomogeneous random intersection graphs.
• On secure communication in a sensor network
• First-Order Model-Checking in Random Graphs and Complex Networks
• Grids in random graphs
• Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size
• MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems
• Poisson approximation of counts of induced subgraphs in random intersection graphs
• Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities
• Geometric random intersection graphs with general connection probabilities
• A Note on the Conductance of the Binomial Random Intersection Graph
• Assortativity and Bidegree Distributions on Bernoulli Random Graph Superpositions
• Balance in random signed intersection graphs
• Assortativity and bidegree distributions on Bernoulli random graph superpositions
• Creating a network-state homomorphism through optimization
• Selected combinatorial problems through the prism of random intersection graphs models
• A spectral algorithm for finding maximum cliques in dense random intersection graphs
• Clustering and percolation on superpositions of Bernoulli random graphs

This page was built for publication: On Random Intersection Graphs: The Subgraph Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243076)