Live briefing
Everything about Clique complex
Abstract simplicial complex describing a graph's cliques
Clique complexes, independence complexes, flag complexes, Whitney complexes and conformal hypergraphs are closely related mathematical objects in graph theory and geometric topology that each describe the cliques of an undirected graph. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Clique complexA 5-minute orientation
- Skim a recent paper: Line Graphs with a Cohen–Macaulay or Gorenstein Clique ComplexInfluential work since 2022
- Pick up a classic book: Computer algorithmsThe most-reprinted book on the subject
- Read the landmark paper: Network clique cover approximation to analyze complex contagions through group interactionsCited 59 times
- Go sideways: Abstract simplicial complexA closely related topic
- Go sideways: Independence complexA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Network clique cover approximation to analyze complex contagions through group interactions
The Clique Complex and Hypergraph Matching
Community Detection in Complex Networks via Clique Conductance
Clique Community Persistence: A Topological Visual Analysis Approach for Complex Networks
The topology of the directed clique complex as a network invariant
Detecting a most closeness-central clique in complex networks
Local Optimization for Clique-Based Overlapping Community Detection in Complex Networks
Structure of n-clique networks embedded in a complex network
🆕 Influential since 2022
Line Graphs with a Cohen–Macaulay or Gorenstein Clique Complex
Identifying clique influences in hypergraphs via the simplicial complex with applications in scientific collaborations
Collapsibility of random clique complexes
On joins of a clique and a co-clique as star complements in regular graphs
Maximal persistence in random clique complexes
📚 Books worth reading
Computer algorithmsEllis Horowitz · 1997
Algorithms on Trees and GraphsGabriel Valiente · 2002
The vulnerable childRick Weissbourd, Richard Weissbourd · 1996
Data structures, algorithms, and applications in C++Sartaj Sahni · 1998
Graph theoryJ. A. Bondy · 2008
Graph-Theoretic Concepts in Computer ScienceMartin Charles Golumbic · 2012
Evolutionary Computation in Combinatorial OptimizationMartin Middendorf · 2013
40 strategies for guiding readers through informational textsBarbara Moss · 2016
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Abstract simplicial complex In combinatorics, an abstract simplicial complex (ASC), often called an abstract complex or just a complex, is a family of sets that is closed under taking…
- Independence complex The independence complex of a graph is a mathematical object describing the independent sets of the graph. Formally, the independence complex of an undirected…
- Hall-type theorems for hypergraphs In the mathematical field of graph theory, Hall-type theorems for hypergraphs are several generalizations of Hall's marriage theorem from graphs to hypergraphs…
- Hypergraph In mathematics, a hypergraph is a generalization of a graph in which an edge can join any number of vertices. In contrast, in an ordinary graph, an edge…
- Matching in hypergraphs In graph theory, a matching in a hypergraph is a set of hyperedges, in which every two hyperedges are disjoint. It is an extension of the notion of matching…
- Matroid parity problem In combinatorial optimization, the matroid parity problem is a problem of finding the largest independent set of paired elements in a matroid, a structure…
- Rainbow-independent set In graph theory, a rainbow-independent set (ISR) is an independent set in a graph, in which each vertex has a different color. Formally, let G = (V, E)…
- Cyclomatic number In graph theory, a branch of mathematics, the cyclomatic number, circuit rank, cycle rank, corank or nullity of an undirected graph is the minimum number…