On the structure of closed 3-manifolds

Jan Mycielski

Displaying similar documents to “On the structure of closed 3-manifolds”

On the classification of $3$ -dimensional $F$ -manifold algebras

Zhiqi Chen, Jifu Li, Ming Ding (2022)

Czechoslovak Mathematical Journal

Similarity:

$F$ -manifold algebras are focused on the algebraic properties of the tangent sheaf of $F$ -manifolds. The local classification of 3-dimensional $F$ -manifolds has been given in A. Basalaev, C. Hertling (2021). We study the classification of 3-dimensional $F$ -manifold algebras over the complex field $ℂ$ .

Degree sums of adjacent vertices for traceability of claw-free graphs

Tao Tian, Liming Xiong, Zhi-Hong Chen, Shipeng Wang (2022)

Czechoslovak Mathematical Journal

Similarity:

The line graph of a graph $G$ , denoted by $L (G)$ , has $E (G)$ as its vertex set, where two vertices in $L (G)$ are adjacent if and only if the corresponding edges in $G$ have a vertex in common. For a graph $H$ , define ${\bar{σ}}_{2} (H) = min {d (u) + d (v) : u v \in E (H)}$ . Let $H$ be a 2-connected claw-free simple graph of order $n$ with $δ (H) \geq 3$ . We show that, if ${\bar{σ}}_{2} (H) \geq \frac{1}{7} (2 n - 5)$ and $n$ is sufficiently large, then either $H$ is traceable or the Ryjáček’s closure $cl (H) = L (G)$ , where $G$ is an essentially $2$ -edge-connected triangle-free graph that can be contracted to one of the two graphs of order 10...

$η$ -Ricci Solitons on $η$ -Einstein ${(L C S)}_{n}$ -Manifolds

Shyamal Kumar Hui, Debabrata Chakraborty (2016)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

Similarity:

The object of the present paper is to study $η$ -Ricci solitons on $η$ -Einstein ${(L C S)}_{n}$ -manifolds. It is shown that if $ξ$ is a recurrent torse forming $η$ -Ricci soliton on an $η$ -Einstein ${(L C S)}_{n}$ -manifold then $ξ$ is (i) concurrent and (ii) Killing vector field.

The Killing Tensors on an $n$ -dimensional Manifold with $S L (n,)$ -structure

Sergey E. Stepanov, Irina I. Tsyganok, Marina B. Khripunova (2016)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

Similarity:

In this paper we solve the problem of finding integrals of equations determining the Killing tensors on an $n$ -dimensional differentiable manifold $M$ endowed with an equiaffine $S L (n,)$ -structure and discuss possible applications of obtained results in Riemannian geometry.

Saturation numbers for linear forests $P_{6} + t P_{2}$

Jingru Yan (2023)

Czechoslovak Mathematical Journal

Similarity:

A graph $G$ is $H$ -saturated if it contains no $H$ as a subgraph, but does contain $H$ after the addition of any edge in the complement of $G$ . The saturation number, $sat (n, H)$ , is the minimum number of edges of a graph in the set of all $H$ -saturated graphs of order $n$ . We determine the saturation number $sat (n, P_{6} + t P_{2})$ for $n \geq \frac{10}{3} t + 10$ and characterize the extremal graphs for $n > \frac{10}{3} t + 20$ .

On the multiplicity of Laplacian eigenvalues for unicyclic graphs

Fei Wen, Qiongxiang Huang (2022)

Czechoslovak Mathematical Journal

Similarity:

Let $G$ be a connected graph of order $n$ and $U$ a unicyclic graph with the same order. We firstly give a sharp bound for $m_{G} (μ)$ , the multiplicity of a Laplacian eigenvalue $μ$ of $G$ . As a straightforward result, $m_{U} (1) \leq n - 2$ . We then provide two graph operations (i.e., grafting and shifting) on graph $G$ for which the value of $m_{G} (1)$ is nondecreasing. As applications, we get the distribution of $m_{U} (1)$ for unicyclic graphs on $n$ vertices. Moreover, for the two largest possible values of $m_{U} (1) \in {n - 5, n - 3}$ , the corresponding graphs $U$ are...

Local density of diffeomorphisms with large centralizers

Christian Bonatti, Sylvain Crovisier, Gioia M. Vago, Amie Wilkinson (2008)

Annales scientifiques de l'École Normale Supérieure

Similarity:

Given any compact manifold $M$ , we construct a non-empty open subset $𝒪$ of the space ${Diff}^{1} (M)$ of $C^{1}$ -diffeomorphisms and a dense subset $𝒟 \subset 𝒪$ such that the centralizer of every diffeomorphism in $𝒟$ is uncountable, hence non-trivial.

Even factor of bridgeless graphs containing two specified edges

Nastaran Haghparast, Dariush Kiani (2018)

Czechoslovak Mathematical Journal

Similarity:

An even factor of a graph is a spanning subgraph in which each vertex has a positive even degree. Let $G$ be a bridgeless simple graph with minimum degree at least $3$ . Jackson and Yoshimoto (2007) showed that $G$ has an even factor containing two arbitrary prescribed edges. They also proved that $G$ has an even factor in which each component has order at least four. Moreover, Xiong, Lu and Han (2009) showed that for each pair of edges $e_{1}$ and $e_{2}$ of $G$ , there is an even factor containing $e_{1}$ and $e_{2}$ ...

Some results on the co-intersection graph of submodules of a module

Lotf Ali Mahdavi, Yahya Talebi (2018)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

Let $R$ be a ring with identity and $M$ be a unitary left $R$ -module. The co-intersection graph of proper submodules of $M$ , denoted by $Ω (M)$ , is an undirected simple graph whose vertex set $V (Ω)$ is a set of all nontrivial submodules of $M$ and two distinct vertices $N$ and $K$ are adjacent if and only if $N + K \neq M$ . We study the connectivity, the core and the clique number of $Ω (M)$ . Also, we provide some conditions on the module $M$ , under which the clique number of $Ω (M)$ is infinite and $Ω (M)$ is a planar graph. Moreover, we give...

Classification of rings with toroidal Jacobson graph

Krishnan Selvakumar, Manoharan Subajini (2016)

Czechoslovak Mathematical Journal

Similarity:

Let $R$ be a commutative ring with nonzero identity and $J (R)$ the Jacobson radical of $R$ . The Jacobson graph of $R$ , denoted by $𝔍_{R}$ , is defined as the graph with vertex set $R ∖ J (R)$ such that two distinct vertices $x$ and $y$ are adjacent if and only if $1 - x y$ is not a unit of $R$ . The genus of a simple graph $G$ is the smallest nonnegative integer $n$ such that $G$ can be embedded into an orientable surface $S_{n}$ . In this paper, we investigate the genus number of the compact Riemann surface in which $𝔍_{R}$ can be embedded and...

Edge-colouring of graphs and hereditary graph properties

Samantha Dorfling, Tomáš Vetrík (2016)

Czechoslovak Mathematical Journal

Similarity:

Edge-colourings of graphs have been studied for decades. We study edge-colourings with respect to hereditary graph properties. For a graph $G$ , a hereditary graph property $𝒫$ and $l \geq 1$ we define $χ_{𝒫, l}^{'} (G)$ to be the minimum number of colours needed to properly colour the edges of $G$ , such that any subgraph of $G$ induced by edges coloured by (at most) $l$ colours is in $𝒫$ . We present a necessary and sufficient condition for the existence of $χ_{𝒫, l}^{'} (G)$ . We focus on edge-colourings of graphs with respect to the hereditary...

Note on improper coloring of $1$ -planar graphs

Yanan Chu, Lei Sun, Jun Yue (2019)

Czechoslovak Mathematical Journal

Similarity:

A graph $G = (V, E)$ is called improperly $(d_{1}, \dots, d_{k})$ -colorable if the vertex set $V$ can be partitioned into subsets $V_{1}, \dots, V_{k}$ such that the graph $G [V_{i}]$ induced by the vertices of $V_{i}$ has maximum degree at most $d_{i}$ for all $1 \leq i \leq k$ . In this paper, we mainly study the improper coloring of $1$ -planar graphs and show that $1$ -planar graphs with girth at least $7$ are $(2, 0, 0, 0)$ -colorable.

Matchings in complete bipartite graphs and the $r$ -Lah numbers

Gábor Nyul, Gabriella Rácz (2021)

Czechoslovak Mathematical Journal

Similarity:

We give a graph theoretic interpretation of $r$ -Lah numbers, namely, we show that the $r$ -Lah number ${⌊\binom{n}{k}⌋}_{r}$ counting the number of $r$ -partitions of an $(n + r)$ -element set into $k + r$ ordered blocks is just equal to the number of matchings consisting of $n - k$ edges in the complete bipartite graph with partite sets of cardinality $n$ and $n + 2 r - 1$ ( $0 \leq k \leq n$ , $r \geq 1$ ). We present five independent proofs including a direct, bijective one. Finally, we close our work with a similar result for $r$ -Stirling numbers of the second kind. ...

Proper connection number of bipartite graphs

Jun Yue, Meiqin Wei, Yan Zhao (2018)

Czechoslovak Mathematical Journal

Similarity:

An edge-colored graph $G$ is proper connected if every pair of vertices is connected by a proper path. The proper connection number of a connected graph $G$ , denoted by $pc (G)$ , is the smallest number of colors that are needed to color the edges of $G$ in order to make it proper connected. In this paper, we obtain the sharp upper bound for $pc (G)$ of a general bipartite graph $G$ and a series of extremal graphs. Additionally, we give a proper $2$ -coloring for a connected bipartite graph $G$ having $δ (G) \geq 2$ and a dominating...