Ramsey's theorem
de Bruijn-Erdős theorem
cocoloring
snark
bicritical
anarboricity
Hedetniemi's conjecture
bichromatic
color
size
chromatic number
coloring
Borůvka's algorithm
parity game
adinkra
graph toughness
altermatic
graph antihole
Robertson-Seymour theorem
isthmus
cubic graph
subdrawing
clique number
graph-theoretically
graphotactic
polygraph
assortativity
edge covering number
reachability
edge set
matchy
regular graph
anticycle
algebraic graph theory
strongly connected component
weighted graph
Cayley's formula
hypergraph
directed edge
collider
graphologic
graphable
path length
protograph
graphlike
undirected path
graphetically
independence number
pseudoforest
graphotactically
Whitney's theorem
forest
Kruskal's tree theorem
clique
tournament
undirected graph
cograph
curve
graphonomic
semantic network
pseudograph
polynema
Turán's theorem
graph theory
domination number
color chart
turning point
digraphon
directed graph
outdegree
four color theorem
Fitzpatrick scale
matching
flow network
boxicity
graphenic
Coxeter graph
degree sequence
chart
plumbago
breadth
subgraph
connected graph
quadrangulation
cyclomatic
pluperfection
circuit rank
diameter
Chinese postman problem
graphette
Veblen's theorem
skinfolk
colour wheel
covering number
valency
matchgate
stripe
connectivity

English words for 'The theorem that any graph labelling (with colours) of a sufficiently large complete graph contains monochromatic cliques.'

As you may have noticed, above you will find words for "The theorem that any graph labelling (with colours) of a sufficiently large complete graph contains monochromatic cliques.". Hover the mouse over the word you'd like to know more about to view its definition. Click search related words by phrase or description. to find a better fitting word. Finally, thanks to ChatGPT, the overall results have been greatly improved.

Recent Queries