On the independence number and Hamiltonicity of uniform random intersection graphs
DOI10.1016/J.TCS.2011.09.003zbMATH Open1233.05186OpenAlexW2014672313MaRDI QIDQ650910FDOQ650910
Christoforos L. Raptopoulos, P. G. Spirakis, Sotiris E. Nikoletseas
Publication date: 7 December 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.09.003
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- On Random Intersection Graphs: The Subgraph Problem
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Connectivity of the uniform random intersection graph
- The vertex degree distribution of random intersection graphs
- Automata, Languages and Programming
- RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
- Automata, Languages and Programming
- Degree distribution of a typical vertex in a general random intersection graph
- Algorithms and Computation
- Independent Sets in Random Graphs from the Weighted Second Moment Method
- Expander Properties and the Cover Time of Random Intersection Graphs
Cited In (14)
- On Hamiltonicity of uniform random intersection graphs
- Equivalence of a random intersection graph and G (n ,p )
- Colouring Non-sparse Random Intersection Graphs
- Recent advances on the Hamiltonian problem: survey III
- On Some Combinatorial Properties of Random Intersection Graphs
- Degree and clustering coefficient in sparse random intersection graphs
- Constructions of independent sets in random intersection graphs
- Approximating fixation probabilities in the generalized Moran process
- Automata, Languages and Programming
- A note on hamiltonicity of uniform random intersection graphs
- Hamilton cycles in the line graph of a random hypergraph
- Hamilton cycles in the line graph of a random graph
- On the chromatic number of non-sparse random intersection graphs
- Maximum cliques in graphs with small intersection number and random intersection graphs
This page was built for publication: On the independence number and Hamiltonicity of uniform random intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650910)
