|
Abstract:
A clique of a graph is a complete subgraph. Given the number of
cliques of a graph of one size (number of vertices), we can ask how
many cliques of other sizes the graph could possibly have. This
problem remains open, but we will discuss some known bounds, as well
as the answer to the analogous question for simplicial complexes.
|