Iyini i-clique emcabangweni wegrafu?
Context:Emkhakheni wezibalo we-graph theory, i-clique iyinhlanganisela yama-vertices egrafu engaqondisiwe ukuze wonke ama-vertices amabili ahlukene ku-clique angomakhelwane. Okungukuthi, i-clique yegrafu G iyi-subgraph ekhishwayo ye-G ephelele. Ama-clique angomunye wemibono eyisisekelo yombono wegrafu futhi asetshenziswa kwezinye izinkinga eziningi zezibalo nokwakhiwa kwamagrafu. Ama-clique nawo afundwe kwezesayensi yamakhompyutha: umsebenzi wokuthola ukuthi ngabe kukhona i-clique yobukhulu obunikeziwe ku-graph (inkinga ye-clique) i-NP-iphelele, kepha naphezu kwalokhu kubangela ubunzima, ama-algorithms amaningi okuthola ama-clique afundiwe.  Nakuba ukutadisha subgraphs ephelele uya emuva okungenani ukuze reformulation graph-theoretic ka Ramsey theory by Erdős & Szekeres (1935), igama elithi clique livela Luce & Perry (1949), abasebenzisa subgraphs ephelele ekuxhumaneni nomphakathi ukuba imodeli cliques zabantu; okungukuthi, amaqembu abantu bonke abaziyo nomunye. Amaqembu anezinye izinhlelo zokusebenza eziningi kwezesayensi futhi ikakhulukazi ku-bioinformatics.
Emfundisweni yegrafu, i-clique iyinhlanganisela yama-vertices egrafu engaqondisiwe ukuze wonke ama-vertices amabili ahlukene ku-clique angomakhelwane.