For a family $\mathcal F\subseteq\binom{[n]}k$ and $R\in\binom{[n]}r$, let $d_{\mathcal F}(R)=|\{F\in\mathcal F:R\subseteq F\}|$ and $\ell_{r,p}(\mathcal F)=\sum_{R\in\binom{[n]}r}d_{\mathcal F}(R)^p$; write $co_p(\mathcal F)=\ell_{k-1,p}(\mathcal F)$ for the codegree power sum. We introduce a method that uses convexit...
Meng-Yue Cao, Mei Lu, Hai-Xiang Zhang· 1 citation· ⚡1
We determine the full automorphism group of every connected Cayley graph on an almost simple group with a normal connection set. We also characterize exactly when the full automorphism group is generated by right translations, group automorphisms preserving the connection set, and inversion. Our results substantially g...
Let $M_n=M(K_{n+1})$ be the graphic matroid of the complete graph, and let $\mathcal{F}_k(M_n)$ be its rank-$k$ flats. We study families $\mathcal{A}\subseteq\mathcal{F}_k(M_n)$ satisfying $\mathrm{rk}(A\wedge B)\ge t$ for all $A,B\in\mathcal{A}$. For $t=1$, this problem is exactly equivalent to Czabarka's partition-EK...
Two permutations $\sigma,\tau\in S_n$ are called disjoint if the composition $\sigma\tau^{-1}$ has no fixed point. If a family $\mathcal F\subseteq S_n$ contains no $s$ pairwise disjoint permutations, then a simple averaging argument gives $|\mathcal F|\leq(s-1)(n-1)!$. Inozemtsev, Kolupaev and Kupavskii characterized...
The Erd\H{o}s Matching Conjecture is governed by two competing ways of excluding $s+1$ disjoint edges: one may concentrate all edges on fewer than $k(s+1)$ vertices, or force every edge to meet a fixed $s$-set. We determine a near-optimal range in which the second construction is extremal. For every fixed $k\ge2$, ther...
Meng-Yue Cao, Hong Liu, Hai-Xiang Zhang· 2 citations· ⚡1
The spectral Erd\H{o}s--Ko--Rado problem asks for the largest adjacency-tensor spectral radius of a $t$-intersecting $k$-uniform family. Keevash, Lenz and Mubayi proved that, for fixed $k,t$ and sufficiently large $n$, the unique extremal family is a full $t$-star, and asked whether such a theorem extends to all $n$. L...
Meng-Yue Cao, Mei Lu, Hai-Xiang Zhang· 0 citations
For a family $\mathcal{F}\subseteq\binom{[n]}k$ and $R\in\binom{[n]}r$, let $d_{\mathcal{F}}(R)=|\{F\in\mathcal{F}:R\subseteq F\}|$ and $\ell_{r,p}(\mathcal{F})=\sum_{R\in\binom{[n]}r}d_{\mathcal{F}}(R)^p$; at the codegree level, write $co_p(\mathcal{F})=\ell_{k-1,p}(\mathcal{F})$. We introduce a new convex-transferenc...
Mengyue Cao, Mei Lu, Haixiang Zhang· 1 citation· ⚡1
Let $V$ be an $n$-dimensional vector space over the finite field $\mathbb F_q$, and let $\mathcal F\subsetneq\genfrac{[}{]}{0pt}{}{V}{k}$. The \emph{projective Ore-degree} of $\mathcal F$ is the minimum, over all $k$-subspaces $S\notin\mathcal F$, of the sum of the $\mathcal F$-degrees of the projective points containe...
Meng-Yue Cao, Mei Lu, Xuyang Yan et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
