Recently, Ma, Qian and Shi determined the maximum size of an n-vertex graph with given fractional matching number s and maximum degree at most d. Motivated by this result, we determine the maximum number of -cliques in a graph with given fractional matching number and minimum degree, which generalizes Shi and Ma's result about the maximum size of a graph with given fractional matching number and minimum degree at least one. We also determine the maximum number of complete bipartite graphs in a graph with prescribed fractional matching number and minimum degree.
No takes yet. Share an insight, caveat, or question.
Li et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: