Related papers: From cycles to circles in Cayley graphs
This paper develops a harmonic Galois theory for finite graphs, thereby classifying harmonic branched $G$-covers of a fixed base $X$ in terms of homomorphisms from a suitable fundamental group of $X$ together with $G$-inertia structures on…
We give a construction of an L-infinity map from any L-infinity algebra into its truncated Chevalley-Eilenberg complex as well as its cyclic and A-infinity analogues. This map fits with the inclusion into the full Chevalley-Eilenberg…
We prove that if Cay(G;S) is a connected Cayley graph with n vertices, and the prime factorization of n is very small, then Cay(G;S) has a hamiltonian cycle. More precisely, if p, q, and r are distinct primes, then n can be of the form kp…
After recent work of Hill, Hopkins, and Ravenel on the Kervaire invariant one problem, as well as Adams' solution of the Hopf invariant one problem, an immediate consequence of Curtis conjecture is that the set of spherical classes in…
We study actions of (infinitely presented) graphical small cancellation groups on the Gromov boundaries of their coned-off Cayley graphs. We show that a class of graphical small cancellation groups, including (infinitely presented)…
We prove new lower bounds on the crossing number of a complete graphs assuming that it is drawn in such a way that it contains a Hamiltonian cycle with no crossings.
We show that every finite group occurs as the automorphism group of infinitely many finite (field) extensions of any given Hilbertian field. This extends and unifies previous results of M. Fried and Takahashi on the global field case.
We study the interplay between spectrum, geometry and boundary conditions for two distinguished self-adjoint realisations of the Laplacian on infinite metric graphs, the so-called riedrichs and Neumann extensions. We introduce a new…
We show that the Cayley graph of the symmetric group $Sym_n$ generated by the cycle $(123...n)$ and the transposition $(12)$ embeds into $L_1$ with bi-Lipschitz distortion $O(1)$. This answers a question of Ostrovskii, and along with…
We consider the existence of patterned Hamilton cycles in randomly colored random graphs. Given a string $\Pi$ over a set of colors $\{1,2,\ldots,r\}$, we say that a Hamilton cycle is $\Pi$-colored if the pattern repeats at intervals of…
A tuple $(G_1,\dots,G_n)$ of graphs on the same vertex set of size $n$ is said to be Hamilton-universal if for every map $\chi: [n]\to[n]$ there exists a Hamilton cycle whose $i$-th edge comes from $G_{\chi(i)}$. Bowtell, Morris, Pehova and…
The main result asserts the existence of noncontractible periodic orbits for compactly supported time dependent Hamiltonian systems on the unit cotangent bundle of the torus or of a negatively curved manifold whenever the generating…
In this paper we consider the number of Hamilton cycles in planar cubic graphs of high cyclic edge-connectivity, answering two questions raised by Chia and Thomassen ("On the number of longest and almost longest cycles in cubic graphs", Ars…
The Hamiltonian cycle polynomial can be evaluated to count the number of Hamiltonian cycles in a graph. It can also be viewed as a list of all spanning cycles of length $n$. We adopt the latter perspective and present a pair of original…
By recent work on some conjectures of Pillay, each definably compact group in a saturated o-minimal structure is an expansion of a compact Lie group by a torsion free normal divisible subgroup, called its infinitesimal subgroup. We show…
Fix a non-negative integer g and a positive integer I dividing 2g-2. For any Henselian, discretely valued field K whose residue field is perfect and admits a degree I cyclic extension, we construct a curve C over K of genus g and index I.…
The aim of this book is to show that the use of f-analytic families of finite type cycles (cycles having finitely many irreducible components, but not compact in general) in a given complex space may be useful in complex geometry, despite…
A Hamilton decomposition of a graph is a partitioning of its edge set into disjoint spanning cycles. The existence of such decompositions is known for all hypercubes of even dimension $2n$. We give a decomposition for the case $n = 2^a3^b$…
We prove that a random graph $G(n,p)$, with $p$ above the Hamiltonicity threshold, is typically such that for any $r$-colouring of its edges there exists a Hamilton cycle with at least $(2/(r+ 1)-o(1))n$ edges of the same colour. This…
We give polynomial-time algorithms for obtaining hamilton circuits in random graphs, G, and random directed graphs, D. If n is finite, we assume that G or D contains a hamilton circuit. If G is an arbitrary graph containing a hamilton…