On Some Combinatorial Properties of Random Intersection Graphs

DOI10.1007/978-3-319-24024-4_21MaRDI QIDQ3464482zbMATHOpenAlexFDO

Authors Christoforos L. Raptopoulos, Sotiris E. Nikoletseas

Publication date 27 January 2016

Published in Algorithms, Probability, Networks, and Games (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-24024-4_21

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Selected Combinatorial Properties of Random Intersection Graphs
• Publication:4729111
• The intersection graph of random sets
• Selected combinatorial problems through the prism of random intersection graphs models
• The chromatic number of random intersection graphs
• On Connectivity in a General Random Intersection Graph
• On randomly generated intersecting hypergraphs
• On the interval number of random graphs
• A guided tour in random intersection graphs
• On Random Intersection Graphs: The Subgraph Problem

Cites work

• Algorithms and Computation
• Coloring Random Intersection Graphs and Complex Networks
• Colouring Non-sparse Random Intersection Graphs
• Component evolution in a secure wireless sensor network
• Equivalence of a random intersection graph and G (n ,p )
• Expander properties and the cover time of random intersection graphs
• Graph colouring and the probabilistic method
• Large independent sets in general random intersection graphs
• On Random Intersection Graphs: The Subgraph Problem
• On the complexity of the herding attack and some related attacks on hash functions
• On the independence number and Hamiltonicity of uniform random intersection graphs
• On the independence number of random graphs
• On the isolated vertices and connectivity in random intersection graphs
• RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
• Sharp thresholds for Hamiltonicity in random intersection graphs
• The chromatic number of random graphs
• The cover time of sparse random graphs
• The vertex degree distribution of random intersection graphs
• Zero–One Laws for Connectivity in Random Key Graphs

Cited in

(16)

• The threshold for combs in random graphs
• Intersections of random hypergraphs and tournaments
• Selected Combinatorial Properties of Random Intersection Graphs
• Selected combinatorial problems through the prism of random intersection graphs models
• Component evolution in general random intersection graphs
• On randomly generated intersecting hypergraphs
• On \(k\)-connectivity and minimum vertex degree in random \(s\)-intersection graphs
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
• A random intersection digraph: indegree and outdegree distributions
• Isoperimetric numbers of randomly perturbed intersection graphs
• Connectivity of the uniform random intersection graph
• On Random Intersection Graphs: The Subgraph Problem
• Equivalence of a random intersection graph and G (n ,p )
• On the chromatic number of non-sparse random intersection graphs
• The intersection graph of random sets
• Recognizing random intersection graphs

This page was built for publication: On Some Combinatorial Properties of Random Intersection Graphs

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