High minimum degree implies large size of matching
Source: St Petersburg 2021 9.6
December 23, 2021
graph theorycombinatorics
Problem Statement
A school has students. Each student has at least friends among the others and among any students, there are always two that are friends. Prove that students can be sent on a kayak trip such that each of the two seater kayaks contain people who are friends. D. Karpov