On Random Intersection Graphs: The Subgraph Problem

From MaRDI portal
Publication:4243076

DOI10.1017/S0963548398003459zbMath0924.05059OpenAlexW2165064763MaRDI QIDQ4243076

Michał Karoński, Karen B. Singer-Cohen, Edward R. 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




Related Items (73)

Parameter Estimators of Sparse Random Intersection Graphs with Thinned CommunitiesPoisson approximation of counts of induced subgraphs in random intersection graphsNetworks beyond pairwise interactions: structure and dynamicsMaximum cliques in graphs with small intersection number and random intersection graphsAssortativity and Bidegree Distributions on Bernoulli Random Graph SuperpositionsA Note on the Conductance of the Binomial Random Intersection GraphA note on the vertex degree distribution of random intersection graphsEfficiently covering complex networks with cliques of similar verticesAssortativity and bidegree distributions on Bernoulli random graph superpositionsScale-free network clustering in hyperbolic and other random graphsRandom subcube intersection graphs. I: Cliques and coveringCentral limit theorem for the largest component of random intersection graphUnnamed ItemConstructions of independent sets in random intersection graphsColouring Non-sparse Random Intersection GraphsOn Some Combinatorial Properties of Random Intersection GraphsEdge Exchangeable Models for Interaction NetworksThe largest component in critical random intersection graphsRandom Intersection Graph ProcessUnnamed ItemDegree distribution of an inhomogeneous random intersection graphMAX CUT in weighted random intersection graphs and discrepancy of sparse random set systemsSelected combinatorial problems through the prism of random intersection graphs modelsSIR epidemics and vaccination on random graphs with clusteringClustering and percolation on superpositions of Bernoulli random graphsThe number of triangles in random intersection graphsA spectral algorithm for finding maximum cliques in dense random intersection graphsTreewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphsPerfect matchings in random intersection graphsDegree and clustering coefficient in sparse random intersection graphsInterval graph limitsThe Second Eigenvalue of Random Walks On Symmetric Random Intersection GraphsPhase transitions for detecting latent geometry in random graphsThe Vertex Degree Distribution of Passive Random Intersection Graph ModelsRecent advances on the Hamiltonian problem: survey IIIA note on hamiltonicity of uniform random intersection graphsOn the independence number and Hamiltonicity of uniform random intersection graphsEpidemics on Random Graphs with Tunable ClusteringEpidemics on random intersection graphsFirst-Order Model-Checking in Random Graphs and Complex NetworksOn the kernel size of clique cover reductions for random intersection graphsTurán and Ramsey Properties of Subcube Intersection GraphsDegree distribution of a typical vertex in a general random intersection graphLarge independent sets in general random intersection graphsMaximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic SizeOn the chromatic number of non-sparse random intersection graphsThe chromatic number of random intersection graphsLarge cliques in sparse random intersection graphsThe coupling method for inhomogeneous random intersection graphs.Joint probability generating function for degrees of active/passive random intersection graphsOn Secure Communication in a Sensor NetworkOn the isolated vertices and connectivity in random intersection graphsSharp thresholds for Hamiltonicity in random intersection graphsPoisson Approximation of the Number of Cliques in Random Intersection GraphsA random intersection digraph: indegree and outdegree distributionsComponent evolution in a secure wireless sensor networkDiameter, connectivity, and phase transition of the uniform random intersection graphA new family of proximity graphs: class cover catch digraphsThe degree of a typical vertex in generalized random intersection graph modelsSize of the largest component in a critical graphOn the distribution of the domination number for random class cover catch digraphsDegree-degree distribution in a power law random intersection graph with clusteringPredicting unobserved links in incompletely observed networksThe shortest distance in random multi-type intersection graphsSelected Combinatorial Properties of Random Intersection GraphsRANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERINGExpander properties and the cover time of random intersection graphsOn the Chromatic Index of Random Uniform HypergraphsIsoperimetric numbers of randomly perturbed intersection graphsRandom intersection graphs with communitiesOn the typical case complexity of graph optimizationTwo Models of Random Intersection Graphs and their ApplicationsOn local weak limit and subgraph counts for sparse random graphs




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