7 papers
A Sharp Spectral Erdős--Ko--Rado Theorem for Uniform Hypergraphs
Mengyu Cao, Mei Lu, Haixiang Zhang
The spectral Erdős--Ko--Rado problem asks for the largest adjacency-tensor spectral radius of a -intersecting -uniform family. Keevash, Lenz and Mubayi proved that, for fixed…
Entropy Transference for Rainbow--Free Colourings of Random Graphs
Mengyu Cao, Mei Lu, Haixiang Zhang
Let be a fixed graph with that contains two adjacent edges, and let be fixed. We establish an entropy-transference principle for rainbow--free edge…
Convex Transference for Degree Powers in Extremal Set Systems
Mengyu Cao, Mei Lu, Haixiang Zhang
For a family and , let and $\ell_{r,p}(\mathcal{F})=\sum_{R\in\binom{[n…
Projective Ore-Degree Conditions for Intersection Theorems in Vector Spaces
Mengyu Cao, Mei Lu, Xuyang Yan +1
Let be an -dimensional vector space over the finite field , and let . The \emph{projective Ore-degree} of $\mat…
Matchings and Near-Optimal 2-Factor Packings in Percolated Vertex-Transitive Graphs
Mengyu Cao, Mei Lu, Xiamiao Zhao
Let be a connected simple vertex-transitive graph on vertices with degree , and let be the random spanning subgraph obtained by retaining each edge of independ…
Edge pancyclic Cayley graphs on symmetric group
Mengyu Cao, Mei Lu, Zequn Lv +1
We study the derangement graph whose vertex set consists of all permutations of , where two vertices are adjacent if and only if their corresponding permutati…