Related papers: H-Kernels by Walks
We prove that if G is an (n,d,lambda)-graph (a d-regular graph on n vertices, all of whose non-trivial eigenvalues are at most lambda) and the following conditions are satisfied: 1. d/lambda >= (log n)^{1+epsilon} for some constant…
Alternating Euler trails has been extensively studied for its diverse applications, for example, in genetic and molecular biology, social science and channel assignment in wireless networks, as well as for theoretical reasons. We will…
We prove a Liv\v{s}ic-type theorem for H\"older continuous and matrix-valued cocycles over non-uniformly hyperbolic systems. More precisely, we prove that whenever $(f,\mu)$ is a non-uniformly hyperbolic system and $A:M \to GL(d,\mathbb{R})…
A twisted cocycle taking values on a Lie Group $G$ is a cocycle that, in each step, is twisted by an automorphism of $G$. In the case when $G=GL(d,\mathbb{R})$, we prove that if two H\"older continuous twisted cocycles satisfying the so…
A Hamilton Berge cycle of a hypergraph on $n$ vertices is an alternating sequence $(v_1, e_1, v_2, \ldots, v_n, e_n)$ of distinct vertices $v_1, \ldots, v_n$ and distinct hyperedges $e_1, \ldots, e_n$ such that $\{v_1,v_n\}\subseteq e_n$…
For any directed graph G with vertex set V, the graph G^(d) is said to be a subset power of G and is defined to have vertex set equal to the set of d-element subsets of V; in G^(d), there is an edge from A to B if and only if we can label…
We apply the Euler tour technique to find subtrees of specified weight as follows. Let $k, g, N_1, N_2 \in \mathbb{N}$ such that $1 \leq k \leq N_2$, $g + h > 2$ and $2k - 4g - h + 3 \leq N_2 \leq 2k + g + h - 2$, where $h := 2N_1 - N_2$.…
We show that the edges crossed by a random walk in a network form a recurrent graph a.s. In fact, the same is true when those edges are weighted by the number of crossings.
A Schur ring (S-ring) over a group $G$ is called separable if every of its similaritities is induced by isomorphism. We establish a criterion for an S-ring to be separable in the case when the group $G$ is cyclic. Using this criterion, we…
We say that a $k$-uniform hypergraph $C$ is a Hamilton cycle of type $\ell$, for some $1\le \ell \le k$, if there exists a cyclic ordering of the vertices of $C$ such that every edge consists of $k$ consecutive vertices and for every pair…
Generalizing a result of Conway, Sloane, and Wilkes for real reflection groups, we show the Cayley graph of an imprimitive complex reflection group with respect to standard generating reflections has a Hamiltonian cycle. This is consistent…
Given a set $R$, a hypergraph is $R$-uniform if the size of every hyperedge belongs to $R$. A hypergraph $\mathcal{H}$ is called \textit{covering} if every vertex pair is contained in some hyperedge in $\mathcal{H}$. In this note, we show…
Given a digraph D, the minimum semi-degree of D is the minimum of its minimum indegree and its minimum outdegree. D is k-ordered Hamiltonian if for every ordered sequence of k distinct vertices there is a directed Hamilton cycle which…
We consider del Pezzo surfaces $X$ with du Val singularities. Assume that $X$ has a $-K_X$-polar cylinder and $\deg X=1$. Let $H$ be an ample divisor. We'll prove that $X$ has a $H$-polar cylinder.
Chen et al. proved that every 18-tough chordal graph has a Hamilton cycle [Networks 31 (1998), 29-38]. Improving upon their bound, we show that every 10-tough chordal graph is Hamiltonian (in fact, Hamilton-connected). We use Aharoni and…
We prove that for every graph $H$ of maximum degree at most $3$ and for every positive integer $q$ there is a finite $f=f(H,q)$ such that every $K_f$-minor contains a subdivision of $H$ in which every edge is replaced by a path whose length…
The study of Cowen-Douglas operators involves not only operator-theoretic tools but also complex geometry on holomorphic vector bundles. By leveraging the properties of holomorphic vector bundles, this paper investigates the cyclicity of…
We use intersections with horizontal manifolds to show that high-dimensional cycles in the Heisenberg group can be approximated efficiently by simplicial cycles. This lets us calculate all of the higher-order Dehn functions of the…
A universal cycle is a compact listing of a class of combinatorial objects. In this paper, we prove the existence of universal cycles of classes of labeled graphs, including simple graphs, trees, graphs with m edges, graphs with loops,…
The cycle double cover conjecture is a long standing problem in graph theory, which links local properties, the valency of a vertex and no bridges, and a global property of the graph, being covered by a particular set of cycles. We prove…