clique_listing (199B)
1 # Clique listing 2 3 Bound: graph with m edges has at most plus O(m^{k/2}) k-cliques 4 5 Special case: [triangle_listing] 6 7 Up: [subgraph_listing] of [clique] 8 9 See also: [clique_problem], [clique_counting]
wiki_researchpersonal research wiki | |
git clone https://a3nm.net/git/wiki_research/ | |
Log | Files | Refs |