Sharp thresholds for Hamiltonicity in random intersection graphs
type: Item
instance of: scholarly article
title: Sharp thresholds for Hamiltonicity in random intersection graphs
zbMATH Open document ID: 1205.05210
author: Charilaos Efthymiou
author: P. G. Spirakis
published in: Theoretical Computer Science
publication date: 2010-10-11T00:00:00Z
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5798142
zbMATH Keywords: random intersection graph
zbMATH Keywords: Hamilton cycles
zbMATH Keywords: sharp threshold
zbMATH Keywords: stochastic order relation between \(G_{n, p}\) and \(G_{n,m,p}\)
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.06.022
OpenAlex ID: W2086721908
cites work: Q3660628
cites work: Q3682518
cites work: Sharp Threshold for Hamiltonicity of Random Geometric Graphs
cites work: Automata, Languages and Programming
cites work: Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
cites work: Tail bounds for occupancy and the satisfiability threshold conjecture
cites work: On Random Intersection Graphs: The Subgraph Problem
cites work: Limit distribution for the existence of Hamiltonian cycles in a random graph
cites work: Q4193507
cites work: Sur deux propriétés des classes d'ensembles
cites work: The degree sequence of a random graph. I. The models
cites work: Expander Properties and the Cover Time of Random Intersection Graphs
cites work: Expander properties and the cover time of random intersection graphs
cites work: Algorithms and Computation
cites work: The vertex degree distribution of random intersection graphs
DOI: 10.1016/J.TCS.2010.06.022
description: scientific article; zbMATH DE number 5798142