Maximum cliques in graphs with small intersection number and random intersection graphs
DOI10.1016/j.cosrev.2020.100353zbMath1487.05198arXiv1204.4054MaRDI QIDQ826323
Paul G. Spirakis, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos
Publication date: 20 December 2021
Published in: Computer Science Review, Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.4054
68Q25: Analysis of algorithms and problem complexity
05C35: Extremal problems in graph theory
05C80: Random graphs (graph-theoretic aspects)
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
