2 problems
Matching
The lower-bound sharpness conjecture for . All four lower bounds are sharp:
Let be the iterated blow-up of an edge, obtained from a complete balanced -partite -graph by inserting a complete balanced -partite -graph recursively in each part.…