Related papers: Realization and classification of Hamiltonian-circ…

Let $(M, \omega)$ be a 6-dimensional closed symplectic manifold with a symplectic $S^1$-action with $M^{S^1} \neq \emptyset$ and $\dim M^{S^1} \leq 2$. Assume that $\omega$ is integral with a generalized moment map $\mu$. We first prove…

Consider a compact metric space $X$, and let $\mathcal{F}=\{f_1,\,f_2,\ldots,\, f_k\}$ be a set of contracting and continuous self maps on $X$. Let $\Sigma$ be a sub-shift on $k$ symbols, and let $\Sigma_k$ be the full shift. Define…

In this expository paper we present some ideas of algebraic topology (more precisely, of homology theory) in a language accessible to non-specialists in the area. A $1$-cycle in a graph is a set $C$ of edges such that every vertex is…

We study the powers of Hamiltonian cycles in randomly augmented Dirac graphs, that is, $n$-vertex graphs $G$ with minimum degree at least $(1/2+\varepsilon)n$ to which some random edges are added. For any Dirac graph and every integer…

A sequence of nonnegative integers \pi =(d_1,d_2,...,d_n) is graphic if there is a (simple) graph G with degree sequence \pi. In this case, G is said to realize or be a realization of \pi. Degree sequence results in the literature generally…

In 2007, Arkin et al. initiated a systematic study of the complexity of the Hamiltonian cycle problem on square, triangular, or hexagonal grid graphs, restricted to polygonal, thin, superthin, degree-bounded, or solid grid graphs. They…

We study the appearance of powers of Hamilton cycles in pseudorandom graphs, using the following comparatively weak pseudorandomness notion. A graph $G$ is $(\varepsilon,p,k,\ell)$-pseudorandom if for all disjoint $X$ and $Y\subset V(G)$…

We prove that the graph of a continuous function $f$, defined on a domain of ${\mathbb C}^n$, is pluripolar if and only if $f$ is holomorphic.

Given a drawing of a graph, its \emph{visual complexity} is defined as the number of geometrical entities in the drawing, for example, the number of segments in a straight-line drawing or the number of arcs in a circular-arc drawing (in…

We show that for each \eta>0 every digraph G of sufficiently large order n is Hamiltonian if its out- and indegree sequences d^+_1\le ... \le d^+_n and d^- _1 \le ... \le d^-_n satisfy (i) d^+_i \geq i+ \eta n or d^-_{n-i- \eta n} \geq n-i…

A graph $G$ is $k$-edge-Hamiltonian if any collection of vertex-disjoint paths with at most $k$ edges altogether belong to a Hamiltonian cycle in $G$. A graph $G$ is $k$-Hamiltonian if for all $S\subseteq V(G)$ with $|S|\le k$, the subgraph…

Let $G$ be a finite group. Let $\sigma =\{\sigma_{i} | i\in I\}$ be a partition of the set of all primes $\Bbb{P}$ and $n$ an integer. We write $\sigma (n) =\{\sigma_{i} |\sigma_{i}\cap \pi (n)\ne \emptyset \}$, $\sigma (G) =\sigma (|G|)$.…

Let $\sigma =\{\sigma_{i} | i\in I\}$ be some partition of the set of all primes $\Bbb{P}$. A set ${\cal H}$ of subgroups of $G$ is said to be a \emph{complete Hall $\sigma $-set} of $G$ if every member $\ne 1$ of ${\cal H}$ is a Hall…

For all integers $k$ with $k\geq 2$, if $G$ is a balanced $k$-partite graph on $n\geq 3$ vertices with minimum degree at least \[…

A \emph{wheel} is a graph made of a cycle of length at least~4 together with a vertex that has at least three neighbors in the cycle. We prove that the problem whose instance is a graph $G$ and whose question is "does $G$ contains a wheel…

For locally finite infinite graphs the notion of Hamilton cycles can be extended to Hamilton circles, homeomorphic images of $S^1$ in the Freudenthal compactification. In this paper we prove of a sufficient condition for the existence of…

We study spectral properties of quantum many-body Hamiltonians through a subsystem-based framework. Given a Hamiltonian of the form $H = \sum_{X \subseteq \Lambda} \Phi(X)$ acting on a tensor product Hilbert space, we associate to each…

We prove that for every $\varepsilon > 0$ there is $c_0$ such that if $G\sim G(n,c/n)$, $c\ge c_0$, then with high probability $G$ can be covered by at most $(1+\varepsilon)\cdot \frac{1}{2}ce^{-c} \cdot n$ vertex disjoint paths, which is…

\noindent An \textit{\(m \times n\) grid graph} is the induced subgraph of the square lattice whose vertex set consists of all integer grid points \(\{(i,j) : 0 \leq i < m,\ 0 \leq j < n\}\). Let $H$ and $K$ be Hamiltonian cycles in an $m…

A bicirculant is a regular graph that admits a semi-regular automorphism with two vertex-orbits of the same size. By $m$ we denote the size of vertex-orbits and by $d$ the valence of a bicirculant. Furthermore, we denote by $s$ the valence…