Bondy and Szwarcfiter defined $\mathrm{ex}^*(n,F)$ as the largest number of edges in an $n$-vertex graph whose edge set partitions into induced copies of $F$; for $F=2K_2$ the deficiency $\binom{n}{2}-\mathrm{ex}^*(n,2K_2)$ is $\Theta(n^{3/2})$. We study the ordered relaxation at fixed matching size, in which each part...
An ordered Ruzsa-Szemeredi graph is a graph whose edge set is partitioned into equal-size matchings, each induced in the suffix of the ordering that begins with it. Behnezhad and Ghafari introduced them to parametrize the update time of fully dynamic matching, but almost nothing is known about the numbers themselves. W...
Hub genes including MVP, WISP1, FCN1, AMPD3, RARRES1, FTL, and KRT14 possess promising auxiliary diagnostic potential, which provides novel clues for subsequent clinical evaluation research on DCM.
