Saturation problems with regularity constraints

For a graph F, we say that another graph G is F-saturated, if G is F-free and adding any edge to G would create a copy of F. We study for a given graph F and integer n whether there exists a regular n-vertex F-saturated graph, and if it does, what is the smallest number of edges of such a graph. We mainly focus on the case when F is a complete graph and prove for example that there exists a $K_3$-saturated regular graph on n vertices for every large enough n.We also study two relaxed versions of the problem: when we only require that no regular F-free supergraph of G should exist or when we drop the F-free condition and only require that any newly added edge should create a new copy of F.     

Oddness to resistance ratios in cubic graphs

Let $G$ be a bridgeless cubic graph. Oddness (weak oddness) is defined as the minimum number of odd components in a 2-factor (an even factor) of $G$, denoted as $\omega \left(G\right)$ (Steffen, 2004) (${\omega }^{\prime }\left(G\right)$ Lukot’ka and Mazák (2016)). Oddness and weak oddness have been referred to as measurements of uncolourability (Fiol et al., 2017, Lukot’ka and Mazák, 2016, Lukot’ka et al., 2015 and, Steffen, 2004), due to the fact that $\omega \left(G\right)=0$ and ${\omega }^{\prime }\left(G\right)=0$ if and only if $G$ is 3-edge-colourable. Another so-called measurement of uncolourability is resistance, defined as the minimum number of edges that can be removed from $G$ such that the resulting graph is 3-edge-colourable, denoted as $r\left(G\right)$ (Steffen, 2004). It is easily shown that $\omega \left(G\right)\ge {\omega }^{\prime }\left(G\right)\ge r\left(G\right)$. While it has been shown that the difference between any two of these measures can be arbitrarily large, it has been conjectured that ${\omega }^{\prime }\left(G\right)\le 2r\left(G\right)$, and that if $G$ is a snark then $\omega \left(G\right)\le 2r\left(G\right)$ (Fiol et al., 2017). In this paper, we disprove the latter by showing that the ratio of oddness to weak oddness can be arbitrarily large. We also offer some insights into the former conjecture by defining what we call resistance reducibility, and hypothesizing that almost all cubic graphs are such resistance reducible.     

A remark on strong law of large numbers for weighted U-statistics

Let {X,Xn; n ≥ 1} be a sequence of i.i.d.random variables with values in a measurable space(S,S) such that E|h(X1,X2,...,Xm)| ∞,where h is a measurable symmetric function from Sminto R =(-∞,∞).Let {wn,i1,i2,...,im; 1 ≤ i1 i2 ··· im ≤ n,n ≥ m} be a matrix array of real numbers.Motivated by a result of Choi and Sung(1987),in this note we are concerned with establishing a strong law of large numbers for weighted U-statistics with kernel h of degree m.We show that lim n→∞m!(n-m)!n!1≤i1i2···im≤n wn,i1,i2,...,im(h(Xi1,Xi2,...,Xim)-θ)=0 a.s.whenever supn≥mmax1≤i1i2···im≤n|wn,i1,i2,...,im|∞,whereθ=Eh(X1,X2,...,Xm).The proof of this result is based on a new general result on complete convergence,which is a fundamental tool,for array of real-valued random variables under some mild conditions.     

Monotonicity properties of ‐functions

We present some monotonicity results for a class of Dirichlet series generalizing previously known results. The fact that is in that class presents a first example of an arithmetic function for which the associated Dirichlet series is completely monotonic, but not logarithmically completely monotonic. Lastly, we use similar techniques to prove another formulation of the Riemann hypothesis for the L‐function associated to the Ramanujan‐tau function.