ABSTRACT Let be three integers and be a sufficiently small positive number such that , , and . A ‐graph is called non‐trivial if it has no isolated vertex. In this paper, we determine the maximum number of edges in a non‐trivial ‐graph with vertices and matching number at most . This result confirms a conjecture proposed by Frankl (On non‐trivial families without a perfect matching, European J. Combin ., 84 (2020), 103044) for the case when is sufficiently large.
Guo et al. (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: