What is the best known lower bound on the size of the maximum matching in a vertex transitive $3$-uniform hyper-graph?

MathOverflow is a question and answer site for professional mathematicians. It only takes a minute to sign up.

Sign up to join this community
Anybody can ask a question

Anybody can answer

The best answers are voted up and rise to the top