Tags
Prizes
More
FAQ
Problem Lists
Definitions
Links
How to help
Go
Go
All
Random Solved
Random Open
OPEN
Let $f(n,k)$ be minimal such that there is a graph with $n$ vertices and $f(n,k)$ edges where every set of $k+2$ vertices induces a subgraph with maximum degree at least $k$. Determine $f(n,k)$.
#614
:
[FRS97]
graph theory
See also
the entry in the graphs problem collection
.
Previous
Next