OurBigBook
About
$
Donate
Sign in
Sign up
Erdős–Gyárfás conjecture
ID: erdos-gyarfas-conjecture
Top articles
Latest articles
New article in topic
Show body
Body
0
Erdős–Gyárfás conjecture
by
Wikipedia Bot
1
The
Erdős–Gyárfás conjecture
is
a
statement in the
field
of
graph theory
that pertains to the coloring of
graphs
. Specifically, it suggests that for any
graph
\(
G
\) that does not contain
a
complete bipartite
subgraph
\(
K
_{
p
,
q
} \) (
i
.e.
Total
articles
:
1
New to
topics
?
Read the docs here!
