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