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.

Ancestors (5)

  1. Unsolved problems in graph theory
  2. Graph theory
  3. Fields of mathematics
  4. Mathematics
  5. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version