Related papers: Optimal Farey sequence for the Congruence subgroup…
The {\em Fibonacci cube} of dimension $n$, denoted as $\Gamma\_n$, is the subgraph of $n$-cube $Q\_n$ induced by vertices with no consecutive 1's. We study the maximum number of disjoint subgraphs in $\Gamma\_n$ isomorphic to $Q\_k$, and…
We describe the structure of virtually solvable normal subgroups in the automorphism group of a right-angled Artin group ${\rm Aut}(A_\Gamma)$. In particular, we prove that a finite normal subgroup in ${\rm Aut}(A_\Gamma)$ has at most order…
Consider a fixed connected, finite graph $\Gamma$ and equip its vertices with weights $p_i$ which are non-negative integers. We show that there is a finite number of possibilities for the coefficients of the canonical cycle of a numerically…
F\"uredi and Gunderson showed that $ex(n, C_{2k+1})$ is achieved only on $K_{\lfloor\frac{n}{2}\rfloor, \lceil\frac{n}{2}\rceil}$ if $n\ge 4k-2$. It is natural to study how far a $ C_{2k+1}$-free graph is from being bipartite.Let $T^*(r,…
We show that there is some absolute constant $c>0$, such that for any union-closed family $\mathcal{F} \subseteq 2^{[n]}$, if \mbox{$|\mathcal{F}| \geq (\frac{1}{2}-c)2^n$}, then there is some element $i \in [n]$ that appears in at least…
Let $\frac{a_1}{b_1}, \frac{a_2}{b_2}, \ldots$ be the Farey fractions of order $n$. We then prove that the inequality $(a_l - a_k)(b_l - b_k) \ge 0$ holds for all $k$ and $l > k$ with $l-k \le \left(\frac{1}{12} - o(1) \right)n$, sharpening…
In this note, we define a new graph $\Gamma_d(G)$ on a finite group $G$, where $d$ is a divisor of $|G|$. The vertices of $\Gamma_d(G)$ are the subgroups of $G$ of order $d$ and two subgroups $H_1$ and $H_2$ of $G$ are said to be adjacent…
Let $G$ be a graph and $v$ any vertex of $G$. We define the degenerate degree of $v$, denoted by $\zeta(v)$ as $\zeta(v)={\max}_{H: v\in H}~\delta(H)$, where the maximum is taken over all subgraphs of $G$ containing the vertex $v$. We show…
For a graph $\Gamma$, a positive integer $s$ and a subgroup $G\leq \Aut(\Gamma)$, we prove that $G$ is transitive on the set of $s$-arcs of $\Gamma$ if and only if $\Gamma$ has girth at least $2(s-1)$ and $G$ is transitive on the set of…
Let $\mathcal{F}$ be a set of $n$ real analytic functions with linearly independent derivatives restricted to a compact interval $I$. We show that for any finite set $A \subset I$, there is a function $f \in \mathcal{F}$ that satisfies…
A theorem of A. Schrijver asserts that a $d$-regular bipartite graph on $2n$ vertices has at least $$\left(\frac{(d-1)^{d-1}}{d^{d-2}}\right)^n$$ perfect matchings. L. Gurvits gave an extension of Schrijver's theorem for matchings of…
The Gruenberg--Kegel graph (or the prime graph) $\Gamma(G)$ of a finite group $G$ is defined as follows. The vertex set of $\Gamma(G)$ is the set of all prime divisors of the order of $G$. Two distinct primes $r$ and $s$ regarded as…
A subset $C$ of the vertex set of a graph $\Gamma$ is called a perfect code of $\Gamma$ if every vertex of $\Gamma$ is at distance no more than one to exactly one vertex in $C$. Let $A$ be a finite abelian group and $T$ a square-free subset…
A good edge-labelling of a simple, finite graph is a labelling of its edges with real numbers such that, for every ordered pair of vertices (u,v), there is at most one nondecreasing path from u to v. In this paper we prove that any graph on…
For a graph $G$ with order $2n$ and a perfect matching, let $f(G)$ and $F(G)$ denote the minimum and maximum forcing number of $G$ respectively. Then $0\leq f(G)\leq F(G)\leq n-1$. Liu and Zhang [10] ever proposed a conjecture: $e(G)\geq…
Let $\Pi$ be a projective plane of order $n$ and $\Gamma_{\Pi}$ be its Levi graph (the point-line incidence graph). For fixed $k \geq 3$, let $c_{2k}(\Gamma_{\Pi})$ denote the number of $2k$-cycles in $\Gamma_{\Pi}$. In this paper we show…
Let $\Gamma$ be the unit circle, $A(\Gamma)$ the Wiener algebra of continuous functions whose series of Fourier coefficients are absolutely convergent, and $A^+$ the subalgebra of $A(\Gamma)$ of functions whose negative coefficients are…
Let $\Gamma$ be a subset of $\{0,1,2,...\}$. We show that if $\Gamma$ has `gaps' then the completeness and frame properties of the system $\{t^ke^{2\pi i nt}: n\in\mathbb{Z},k\in\Gamma\}$ differ from those of the classical exponential…
While a number of bounds are known on the zero forcing number $Z(G)$ of a graph $G$ expressed in terms of the order of a graph and maximum or minimum degree, we present two bounds that are related to the (upper) total domination number…
Let $G$ be a connected $d$-regular graph of order $n$, where $d\geq3$. Let $\lambda_{2}(G)$ be the second largest eigenvalue of $G$. For even $n$, we show that $G$ contains $\left\lfloor\frac{2}{3}(d-\lambda_{2}(G))\right\rfloor$…