On mixed Moore graphs

The Moore bound for a directed graph of maximum out-degree d and diameter k is $M_{d,k}=1+d+d^2+\cdots +d^k$. It is known that digraphs of order $M_{d,k}$ (Moore digraphs) do not exist for $d>1$ and $k>1$. Similarly, the Moore bound for an undirected graph of maximum degree d and diameter k is $M_{d,k}^{*}=1+d+d(d-1)+\cdots +d(d-1{)}^{k-1}$. Undirected Moore graphs only exist in a small number of cases. Mixed (or partially directed) Moore graphs generalize both undirected and directed Moore graphs. In this paper, we shall show that all known mixed Moore graphs of diameter $k=2$ are unique and that mixed Moore graphs of diameter $k⩾3$ do not exist.     

Nonexistence of some linear codes over the field of order four

We consider the problem of determining $n_4(5,d)$, the smallest possible length $n$ for which an ${[n,5,d]}_4$ code of minimum distance $d$ over the field of order 4 exists. We prove the nonexistence of ${[g_4(5,d)+1,5,d]}_4$ codes for $d=31,47,48,59,60,61,62$ and the nonexistence of a ${[g_4(5,d),5,d]}_4$ code for $d=138$ using the geometric method through projective geometries, where $g_q(k,d)={\sum }_{i=0}^{k?1}?d∕q^i?$. This yields to determine the exact values of $n_4(5,d)$ for these values of $d$. We also give the updated table for $n_4(5,d)$ for all $d$ except some known cases.     

d-matching in 3-uniform hypergraphs

A matching in a 3-uniform hypergraph is a set of pairwise disjoint edges. A $d$-matching in a 3-uniform hypergraph $H$ is a matching of size $d$. Let $V_1,V_2$ be a partition of $n$ vertices such that $\left|V_1\right|=2d?1$ and $\left|V_2\right|=n?2d+1$. Denote by $E_3(2d?1,n?2d+1)$ the 3-uniform hypergraph with vertex set $V_1\cup V_2$ consisting of all those edges which contain at least two vertices of $V_1$. Let $H$ be a 3-uniform hypergraph of order $n\ge 9d^2$ such that $deg\left(u\right)+deg\left(v\right)>2\left[\left(\genfrac{}{}{0ex}{}{n?1}{2}\right)?\left(\genfrac{}{}{0ex}{}{n?d}{2}\right)\right]$ for any two adjacent vertices $u,v\in V\left(H\right)$. In this paper, we prove $H$ contains a $d$-matching if and only if $H$ is not a subgraph of $E_3(2d?1,n?2d+1)$.     

Weak version of restriction estimates for spheres and paraboloids in finite fields

We study $L^p-L^r$ restriction estimates for algebraic varieties in d-dimensional vector spaces over finite fields. Unlike the Euclidean case, if the dimension d is even, then it is conjectured that the $L^{(2d+2)/(d+3)}-L^2$ Stein–Tomas restriction result can be improved to the $L^{(2d+4)/(d+4)}-L^2$ estimate for both spheres and paraboloids in finite fields. In this paper we show that the conjectured $L^p-L^2$ restriction estimate holds in the specific case when test functions under consideration are restricted to d-coordinate functions or homogeneous functions of degree zero. To deduce our result, we use the connection between the restriction phenomena for our varieties in d dimensions and those for homogeneous varieties in $(d+1)$ dimensions.     

Minimal homogeneous Steiner 2-(v,3) trades

A Steiner 2-$(v,3)$ trade is a pair $(T_1,T_2)$ of disjoint partial Steiner triple systems, each on the same set of $v$ points, such that each pair of points occurs in $T_1$ if and only if it occurs in $T_2$. A Steiner 2-$(v,3)$ trade is called d-homogeneous if each point occurs in exactly d blocks of $T_1$ (or $T_2$). In this paper we construct minimal d-homogeneous Steiner 2-$(v,3)$ trades of foundation $v$ and volume $\mathit{dv}/3$ for sufficiently large values of $v$. (Specifically, $v>3(1.75d^2+3)$ if $v$ is divisible by 3 and $v>d(4^{d/3+1}+1)$ otherwise.)     

Defective 2-colorings of planar graphs without 4-cycles and 5-cycles

A 2-coloring is a coloring of vertices of a graph with colors 1 and 2. Define $V_i?\{v\in V\left(G\right):c\left(v\right)=i\}$ for $i=1$ and $2.$ We say that $G$ is $(d_1,d_2)$-colorable if $G$ has a 2-coloring such that $V_i$ is an empty set or the induced subgraph $G\left[V_i\right]$ has the maximum degree at most $d_i$ for $i=1$ and $2.$ Let $G$ be a planar graph without 4-cycles and 5-cycles. We show that the problem to determine whether $G$ is $(0,k)$-colorable is NP-complete for every positive integer $k.$ Moreover, we construct non-$(1,k)$-colorable planar graphs without 4-cycles and 5-cycles for every positive integer $k.$ In contrast, we prove that $G$ is $(d_1,d_2)$-colorable where $(d_1,d_2)=(4,4),(3,5),$ and $(2,9).$     

A stability version for a theorem of Erdős on nonhamiltonian graphs

Let $n,d$ be integers with $1\le d\le ?\frac{n?1}{2}?$, and set $h(n,d)?\left(\genfrac{}{}{0ex}{}{n?d}{2}\right)+d^2$ and $e(n,d)?max\{h(n,d),h(n,?\frac{n?1}{2}?)\}$. Because $h(n,d)$ is quadratic in $d$, there exists a $d_0\left(n\right)=(n∕6)+O\left(1\right)$ such that

$e(n,1)>e(n,2)>?>e(n,d_0)=e(n,d_0+1)=?=e\left(n,?\frac{n?1}{2}?\right).$

A theorem by Erd?s states that for $d\le ?\frac{n?1}{2}?$, any $n$-vertex nonhamiltonian graph $G$ with minimum degree $\delta \left(G\right)\ge d$ has at most $e(n,d)$ edges, and for $d>d_0\left(n\right)$ the unique sharpness example is simply the graph $K_n?E\left(K_{?(n+1)∕2?}\right)$. Erd?s also presented a sharpness example $H_{n,d}$ for each $1\le d\le d_0\left(n\right)$.We show that if $d<d_0\left(n\right)$ and a $2$-connected, nonhamiltonian $n$-vertex graph $G$ with $\delta \left(G\right)\ge d$ has more than $e(n,d+1)$ edges, then $G$ is a subgraph of $H_{n,d}$. Note that $e(n,d)?e(n,d+1)=n?3d?2\ge n∕2$ whenever $d<d_0\left(n\right)?1$.     

Bounding the number of limit cycles of discontinuous differential systems by using Picard–Fuchs equations

In this paper, by using Picard–Fuchs equations and Chebyshev criterion, we study the upper bounds of the number of limit cycles given by the first order Melnikov function for discontinuous differential systems, which can bifurcate from the periodic orbits of quadratic reversible centers of genus one (r19): $\dot{x}=y?12x^2+16y^2$, $\dot{y}=?x?16xy$, and (r20): $\dot{x}=y+4x^2$, $\dot{y}=?x+16xy$, and the periodic orbits of the quadratic isochronous centers $(S_1):\dot{x}=?y+x^2?y^2$, $\dot{y}=x+2xy$, and $(S_2):\dot{x}=?y+x^2$, $\dot{y}=x+xy$. The systems (r19) and (r20) are perturbed inside the class of polynomial differential systems of degree n and the system $(S_1)$ and $(S_2)$ are perturbed inside the class of quadratic polynomial differential systems. The discontinuity is the line $y=0$. It is proved that the upper bounds of the number of limit cycles for systems (r19) and (r20) are respectively $4n?3(n\ge 4)$ and $4n+3(n\ge 3)$ counting the multiplicity, and the maximum numbers of limit cycles bifurcating from the period annuluses of the isochronous centers $(S_1)$ and $(S_2)$ are exactly 5 and 6 (counting the multiplicity) on each period annulus respectively.     

On q-Steiner systems from rank metric codes

In this paper we prove that rank metric codes with special properties imply the existence of $q$-analogs of suitable designs. More precisely, we show that the minimum weight vectors of a $[2d,d,d]$ dually almost MRD code $C\le {\mathbb{F}}_{q^m}^{2d}$$(2d\le m)$ which has no code words of rank weight $d+1$ form a $q$-Steiner system $S{(d?1,d,2d)}_q$. This is the q-analog of a result in classical coding theory and it may be seen as a first step to prove a q-analog of the famous Assmus–Mattson Theorem.