Erdős Problem 918: Ii
Is there a graph with vertices and chromatic number such that every subgraph on vertices has chromatic number ?
Questions, not proof records
Each statement record keeps the mathematical question, a dated status source, accessible references, and any pinned Lean formulation separate from proof verification.
sorry marks an admitted statement, not a proof. Source indexing does not mean the formulation has been independently built or certified by Therefore.Is there a graph with vertices and chromatic number such that every subgraph on vertices has chromatic number ?
Is there a graph with vertices and chromatic number such that every subgraph on vertices has chromatic number ?
Is there a graph with vertices and chromatic number such that every subgraph on vertices has chromatic number ?
Is it true that, for , for some constant ?
Let be a set containing no solutions to . Must there be a set of cardinality continuum such that ?
Let be a set of positive integers. Does contain a sum-free set of size at least , where as ?
Let be an abelian group of size , and suppose that has density . Are there at least tuples such that whenever ?
Note: We interpret indices modulo 5.
Is a polynomial in , for fixed ?
We formulate this as asking if has polynomial growth in . We know it is not the case for [Gr21, p.3].
It remains an interesting open problem to actually write down a colouring showing (say) for some . [Gr24]
from [AKS14, Table 2].
from [AKS14, Table 2].
from [AKS14, Table 2].
from [AKS14, Table 2].
from [AKS14, Table 2].
from [AKS14, Table 2].
from [AKS14, Table 2].
from [AKS14, Table 2].
from [AKS14, Table 2].
from [AKS14, Table 2].
from [AKS14, Table 2].