Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with clique
Search options answers only
not deleted
user 108026
A clique is a subset of the vertices of a graph such that every pair of vertices in the subset is connected by an edge.
3
votes
Clique-problem for planar graph
Now, if some graph had a clique of size $5$, by taking this clique as a subgraph we would have that the complete graph on $5$ vertices $K_5$ is planar. … Thus, $K_5$ is not planar and our original graph has no clique of size $5$ or more. …
- 2,542
3
votes
Accepted
Prove "Vertex Cover OR Clique" is NP complete
You can easily reduce from clique as follows. … Now, $G$ has a clique of size $\geq k$ if and only if $G'$ has a clique of size $\geq k$. …
- 2,542