What is a Clique? | Graph Theory, Cliques

What is a clique? A clique in graph theory is an interesting concept with a lot of depth to explore. We define the term and give some examples in today’s math video lesson! A clique C of a graph G is usually defined as a subset of the vertex set of G such that every pair of distinct vertices in C is adjacent in G. In other words, a subset of the vertex set of G is a clique if and only if its induced subgraph is a complete graph. Watch the full video lesson to learn more and see some examples! In future lessons we will explore maximal cliques and how to find them! Other network stuff... Lesson on k-cliques: Lesson on k-cores: Lesson on k-clans and k-clubs: I hope you find this video helpful, and be sure to ask any questions down in the comments! ◉Textbooks I Like◉ Graph Theory: Real Analysis: Proofs and Set Theory: (available for free online) Statistics: Abstract Algebra: Discrete Math: Number Theory: The song I play at the end is “Back Then“ by B STORY. ◆ Donate on PayPal: ◆ Support Wrath of Math on Patreon: WRATH OF MATH ◆ Support Wrath of Math on Patreon: Follow Wrath of Math on... ● Instagram: ● Facebook: ● Twitter: My Music Channel: