Related papers: Toroidal Cartesian Products Where One Factor is 3-…

The paper is devoted to the study of coarse shape of Cartesian products of topological spaces. If the Cartesian product of two spaces $X$ and $Y$ admits an HPol-expansion, which is the Cartesian product of HPol-expansions of these spaces,…

Let $t>0$ be a real number and $G$ be a graph. We say $G$ is $t$-tough if for every cutset $S$ of $G$, the ratio of $|S|$ to the number of components of $G-S$ is at least $t$. The Toughness Conjecture of Chv\'atal, stating that there exists…

Work of Glover and Huneke shows that a cubic graph embeds into the real projective plane if and only if it does not contain one of six topological minors called cubic projective plane obstructions. Here we classify up to equivalence the…

A graph $G$ is well-covered if all maximal independent sets of $G$ have the same cardinality. In 1992 Topp and Volkmann investigated the structure of well-covered graphs that have nontrivial factorizations with respect to some of the…

Dujmovi\'c, Joret, Micek, Morin, Ueckerdt and Wood [J. ACM 2020] proved that for every graph $G$ with Euler genus $g$ there is a graph $H$ with treewidth at most 4 and a path $P$ such that $G\subseteq H \boxtimes P \boxtimes…

It is known that if G is a connected simple graph, then G^3 is Hamiltonian (in fact, Hamilton-connected). A simple graph is k-ordered Hamiltonian if for any sequence v_1, v_2, ..., v_k of k vertices there is a Hamiltonian cycle containing…

Thomassen's chord conjecture from 1976 states that every longest cycle in a $3$-connected graph has a chord. This is one of the most important unsolved problems in graph theory. Let $H$ be a subgraph of a graph $G$. A vertex $v$ of $H$ is…

The generalized $k$-connectivity $\kappa_{k}(G)$ of a graph $G$, which was introduced by Chartrand et al.(1984) is a generalization of the concept of vertex connectivity. Let $G$ and $H$ be nontrivial connected graphs. Recently, Li et al.…

We prove several results about matroids and matroidal families associated with rigidity in dimension $2$. In particular, we establish new properties of the generic rigidity matroid family $\mathcal{R}$ and Kalai's hyperconnectivity matroid…

A genus-1 tangle G is an arc properly embedded in a standardly embedded solid torus S in the 3-sphere. We say that a genus-1 tangle embeds in a knot K in S^3 if the tangle can be completed by adding an arc exterior to the solid torus to…

We show that if $r\geq 3$ and $\alpha$ is a faithful $Z^r$-Cartan action on a torus $T^d$ by automorphisms, then any closed subset of $(T^d)^2$ which is invariant and topologically transitive under the diagonal $\bZ^r$-action by $\alpha$ is…

A graph $G$ on $n$ vertices is Hamiltonian if it contains a spanning cycle, and pancyclic if it contains cycles of all lengths from 3 to $n$. In 1984, Fan presented a degree condition involving every pair of vertices at distance two for a…

A threefold isogenous to a product of curves $X$ is a quotient of a product of three compact Riemann surfaces of genus at least two by the free action of a finite group. In this paper we study these threefolds under the assumption that the…

Given a projective algebraic set X, its dual graph G(X) is the graph whose vertices are the irreducible components of X and whose edges connect components that intersect in codimension one. Hartshorne's connectedness theorem says that if…

We study multisections of embedded surfaces in 4-manifolds admitting effective torus actions. We show that a simply-connected 4-manifold admits a genus one multisection if and only if it admits an effective torus action. Orlik and Raymond…

For a group $ G $ we consider its tensor square $G \otimes G$ and exterior square $G \wedge G$. We prove that for a circularly orderable group $G$, under some assumptions on $H_1(G)$ and $H_2(G)$, its exterior square and tensor square are…

An arc of a graph is an oriented edge and a 3-arc is a 4-tuple $(v,u,x,y)$ of vertices such that both $(v,u,x)$ and $(u,x,y)$ are paths of length two. The 3-arc graph of a graph $G$ is defined to have vertices the arcs of $G$ such that two…

Let $\tilde{K}_{3,n}$, $n\geq 3$, be the simple graph obtained from $K_{3,n}$ by adding three edges to a vertex part of size three. We prove that if $H$ is a hyperplane of a 3-connected matroid $M$ and $M \not\cong M^*(\tilde{K}_{3,n})$,…

Let $G$ be a graph on $n$ vertices. An induced subgraph $H$ of $G$ is called heavy if there exist two nonadjacent vertices in $H$ with degree sum at least $n$ in $G$. We say that $G$ is $H$-heavy if every induced subgraph of $G$ isomorphic…

The generalized $k$-connectivity $\kappa_k(G)$ of a graph $G$, introduced by Chartrand et al., is a natural and nice generalization of the concept of (vertex-)connectivity. In this paper, we prove that for any two connected graphs $G$ and…