For a fixed $k$-uniform hypergraph $F$, let $\mathrm{ex}_k(n,F)$ denote the maximum number of edges in an $F$-free $k$-uniform hypergraph on $n$ vertices. We prove that for every integer $k\ge2$ and every rational $r\in[0,1]$ there exists a $k$-uniform hypergraph $F_{k,r}$ such that \begin{equation*} \mathrm{ex}_k(n,F_...
We set G to be a connected graph of even order n ≥ b + 3, where b ≥ 3 is odd. We establish a sharp sufficient condition for the existence of an odd [1, b]-factor in terms of the signless Laplacian spectral radius q(G¯) of the complement graph. Specifically, if q(G¯)≤Φ(n,b)=n+2b−1+(n+2b−1)2−8b(b+1)2, then G has an odd [...
Zeng-Hui Shen, Jue Dai, Chang Liu et al.· Journal of Physics, Conferen...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.