Ramsey's theorem
de Bruijn-Erdős theorem
cocoloring
snark
adinkra
coloring
chromatic number
cubic graph
digraphon
Sperner's lemma
polygraph
Kruskal's tree theorem
anarboricity
four color theorem
bicritical
forest
pseudoforest
subdrawing
Veblen's theorem
edge set
Whitney's theorem
altermatic
unicolor
Turán's theorem
cage
graph-theoretically
clique number
independence number
isthmus
color
bichromatic
chart
independent set
Petersen's theorem
bidirected
computable
Bethe lattice
Cayley's formula
block graph
edge covering number
graphotactically
flood fill
Hedetniemi's conjecture
graphotactic
ring
Robertson-Seymour theorem
graphable
path length
regular graph
anticycle
graphlike
directed acyclic graph
circuit rank
tree
adjacency list
monochromic
clique
graph toughness
tournament
size
matroid
van der Waerden's theorem
Menger's theorem
Borůvka's algorithm
cyclomatic
pluperfect
undirected graph
connected graph
archigrapheme
graphenic
pluperfection
boxicity
weighted graph
dual graph
comdag
nullhomotopic
strongly connected component
rose
Chinese postman problem
nulhomotopic
pancyclic
bouquet of circles
parity game
colour triangle
wedge of circles
graphetically
null-homotopic
directed
apeirotope
multigraphene
kaleidoscope
stripe
dendrimer
subgraph
allography
graphonomic
plumbago

English words for 'The theorem that any graph labelling (with colours) of an infinite complete graph contains at least one infinite monochromatic clique.'

As you may have noticed, above you will find words for "The theorem that any graph labelling (with colours) of an infinite complete graph contains at least one infinite monochromatic clique.". 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