Pages that link to "Item:Q3068767"
From MaRDI portal
The following pages link to Equivalence of a random intersection graph and <i>G</i> (<i>n</i> ,<i>p</i> ) (Q3068767):
Displayed 14 items.
- Random subcube intersection graphs. I: Cliques and covering (Q311574) (← links)
- On the chromatic number of non-sparse random intersection graphs (Q519889) (← links)
- The chromatic number of random intersection graphs (Q521763) (← links)
- The coupling method for inhomogeneous random intersection graphs. (Q528984) (← links)
- Maximum cliques in graphs with small intersection number and random intersection graphs (Q826323) (← links)
- The largest component in critical random intersection graphs (Q1656908) (← links)
- Phase transitions for detecting latent geometry in random graphs (Q2210754) (← links)
- Diameter, connectivity, and phase transition of the uniform random intersection graph (Q2275460) (← links)
- Poisson approximation of counts of induced subgraphs in random intersection graphs (Q2359960) (← links)
- Constructions of independent sets in random intersection graphs (Q2637343) (← links)
- On Some Combinatorial Properties of Random Intersection Graphs (Q3464482) (← links)
- MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems (Q6053474) (← links)
- Selected combinatorial problems through the prism of random intersection graphs models (Q6057306) (← links)
- A spectral algorithm for finding maximum cliques in dense random intersection graphs (Q6114455) (← links)