Selected Combinatorial Properties of Random Intersection Graphs

DOI10.1007/978-3-642-24897-9_15MaRDI QIDQ3098045zbMATH OpenOpenAlexFDO

Authors Christoforos L. Raptopoulos, Sotiris E. Nikoletseas, P. G. Spirakis

Publication date 11 November 2011

Published in Algebraic Foundations in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-24897-9_15

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• Algorithms and Computation
• Automata, Languages and Programming
• Component evolution in general random intersection graphs
• Connectivity of the uniform random intersection graph
• Degree distribution of a typical vertex in a general random intersection graph
• Expander Properties and the Cover Time of Random Intersection Graphs
• Large independent sets in general random intersection graphs
• On Random Intersection Graphs: The Subgraph Problem
• Random Geometric Graphs
• Random graphs.
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
• RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
• The cover time of sparse random graphs
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• The vertex degree distribution of random intersection graphs

Cited in

(15)

• The intersection graph of random sets
• On randomly generated intersecting hypergraphs
• Recognizing random intersection graphs
• On small subgraphs in a random intersection digraph
• Equivalence of a random intersection graph and G (n ,p )
• On Some Combinatorial Properties of Random Intersection Graphs
• Finding Hamilton cycles in random intersection graphs
• Intersections of random hypergraphs and tournaments
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
• Automata, Languages and Programming
• MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems
• Selected combinatorial problems through the prism of random intersection graphs models
• A spectral algorithm for finding maximum cliques in dense random intersection graphs
• A note on hamiltonicity of uniform random intersection graphs
• On the independence number and Hamiltonicity of uniform random intersection graphs

This page was built for publication: Selected 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 Q3098045)