Large cliques in sparse random intersection graphs
From MaRDI portal
Publication:528977
zbMath1361.05117arXiv1302.4627MaRDI QIDQ528977
Valentas Kurauskas, Mindaugas Bloznelis
Publication date: 18 May 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.4627
Random graphs (graph-theoretic aspects) (05C80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Density (toughness, etc.) (05C42)
Related Items (8)
Maximum cliques in graphs with small intersection number and random intersection graphs ⋮ Random subcube intersection graphs. I: Cliques and covering ⋮ The number of triangles in random intersection graphs ⋮ A spectral algorithm for finding maximum cliques in dense random intersection graphs ⋮ Finding Cliques in Social Networks: A New Distribution-Free Model ⋮ Phase transitions for detecting latent geometry in random graphs ⋮ On the Chromatic Index of Random Uniform Hypergraphs ⋮ On local weak limit and subgraph counts for sparse random graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Assortativity and clustering of sparse random intersection graphs
- Maximum cliques in graphs with small intersection number and random intersection graphs
- Number of cliques in random scale-free network ensembles
- Degree distribution of a typical vertex in a general random intersection graph
- On small subgraphs in a random intersection digraph
- Degree and clustering coefficient in sparse random intersection graphs
- Large Cliques in a Power-Law Random Graph
- Statistical mechanics of complex networks
- Erdős–Ko–Rado in Random Hypergraphs
- RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
- On Random Intersection Graphs: The Subgraph Problem
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- Poisson Approximation of the Number of Cliques in Random Intersection Graphs
- Coloring Random Intersection Graphs and Complex Networks
- Collective dynamics of ‘small-world’ networks
- Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability
- Regularly Varying Sequences
- On local weak limit and subgraph counts for sparse random graphs
This page was built for publication: Large cliques in sparse random intersection graphs
