Permanent problem IDPPL 059
Graph theory
What is ex_3(n,K_4^3)? That is, the largest number of 3-edges which can placed on n vertices so that there exists no K_4^3, a set of 4 vertices which is covered by all 4 possible 3-edges.
What is ex_3(n,K_4^3)? That is, the largest number of 3-edges which can placed on n vertices so that there exists no K_4^3, a set of 4 vertices which is covered by all 4 possible 3-edges.
A solution must appear in a reputable journal, with documentation that Erdős offered the displayed amount. Claims are administered by the Combinatorics Foundation; erdosproblems.com does not pay awards.