Erdos Problems 108 and 740! #454
Conversation
|
Thanks for your pull request! It looks like this may be your first contribution to a Google open source project. Before we can look at your pull request, you'll need to sign a Contributor License Agreement (CLA). View this failed invocation of the CLA check for more information. For the most up to date status, view the checks section at the bottom of the pull request. |
|
|
||
| *Reference:* [Erdős Problems](https://erdosproblems.com/108) | ||
|
|
||
| For every r≥4 and k≥2, does there exist finite f(k,r) such that every graph of chromatic number ≥f(k,r) contains a subgraph of girth ≥r and chromatic number ≥k? |
There was a problem hiding this comment.
The convention we're following is to have the statement of the theorem as a docstring above the result rather than in the module docstring.
Paul-Lez
added
the
Awaiting author
Co-authored-by: Paul Lezeau <[email protected]>
Co-authored-by: Paul Lezeau <[email protected]>
|
@Robertboy18 would you be able to sign the CLA or do you need help, for instance changing the email address used in the pull request if another one is already associated with signing the CLA? |
4 participants
Pushed #339 and also related problem https://www.erdosproblems.com/740 which is basically the infinite version in some sense to 108!