Displaying similar documents to “On uniquely partitionable relational structures and object systems”

n -angulated quotient categories induced by mutation pairs

Zengqiang Lin (2015)

Czechoslovak Mathematical Journal

Similarity:

Geiss, Keller and Oppermann (2013) introduced the notion of n -angulated category, which is a “higher dimensional” analogue of triangulated category, and showed that certain ( n - 2 ) -cluster tilting subcategories of triangulated categories give rise to n -angulated categories. We define mutation pairs in n -angulated categories and prove that given such a mutation pair, the corresponding quotient category carries a natural n -angulated structure. This result generalizes a theorem of Iyama-Yoshino...

One-sided n -suspended categories

Jing He, Yonggang Hu, Panyue Zhou (2024)

Czechoslovak Mathematical Journal

Similarity:

For an integer n 3 , we introduce a simultaneous generalization of ( n - 2 ) -exact categories and n -angulated categories, referred to as one-sided n -suspended categories. Notably, one-sided n -angulated categories are specific instances of this structure. We establish a framework for transitioning from these generalized categories to their n -angulated counterparts. Additionally, we present a method for constructing n -angulated quotient categories from Frobenius n -prile categories. Our results unify...

Two results of n -exangulated categories

Jian He, Jing He, Panyue Zhou (2024)

Czechoslovak Mathematical Journal

Similarity:

M. Herschend, Y. Liu, H. Nakaoka introduced n -exangulated categories, which are a simultaneous generalization of n -exact categories and ( n + 2 ) -angulated categories. This paper consists of two results on n -exangulated categories: (1) we give an equivalent characterization of axiom (EA2); (2) we provide a new way to construct a closed subfunctor of an n -exangulated category.

Generalized connectivity of some total graphs

Yinkui Li, Yaping Mao, Zhao Wang, Zongtian Wei (2021)

Czechoslovak Mathematical Journal

Similarity:

We study the generalized k -connectivity κ k ( G ) as introduced by Hager in 1985, as well as the more recently introduced generalized k -edge-connectivity λ k ( G ) . We determine the exact value of κ k ( G ) and λ k ( G ) for the line graphs and total graphs of trees, unicyclic graphs, and also for complete graphs for the case k = 3 .

On characterization of uniquely 3-list colorable complete multipartite graphs

Yancai Zhao, Erfang Shan (2010)

Discussiones Mathematicae Graph Theory

Similarity:

For each vertex v of a graph G, if there exists a list of k colors, L(v), such that there is a unique proper coloring for G from this collection of lists, then G is called a uniquely k-list colorable graph. Ghebleh and Mahmoodian characterized uniquely 3-list colorable complete multipartite graphs except for nine graphs: K 2 , 2 , r r ∈ 4,5,6,7,8, K 2 , 3 , 4 , K 1 * 4 , 4 , K 1 * 4 , 5 , K 1 * 5 , 4 . Also, they conjectured that the nine graphs are not U3LC graphs. After that, except for K 2 , 2 , r r ∈ 4,5,6,7,8, the others have been proved not...

Paired domination in prisms of graphs

Christina M. Mynhardt, Mark Schurch (2011)

Discussiones Mathematicae Graph Theory

Similarity:

The paired domination number γ p r ( G ) of a graph G is the smallest cardinality of a dominating set S of G such that ⟨S⟩ has a perfect matching. The generalized prisms πG of G are the graphs obtained by joining the vertices of two disjoint copies of G by |V(G)| independent edges. We provide characterizations of the following three classes of graphs: γ p r ( π G ) = 2 γ p r ( G ) for all πG; γ p r ( K G ) = 2 γ p r ( G ) ; γ p r ( K G ) = γ p r ( G ) .

On n -exact categories

Said Manjra (2019)

Czechoslovak Mathematical Journal

Similarity:

An n -exact category is a pair consisting of an additive category and a class of sequences with n + 2 terms satisfying certain axioms. We introduce n -weakly idempotent complete categories. Then we prove that an additive n -weakly idempotent complete category together with the class 𝒞 n of all contractible sequences with n + 2 terms is an n -exact category. Some properties of the class 𝒞 n are also discussed.

The categories of presheaves containing any category of algebras

V. Trnková, J. Reiterman

Similarity:

ContentsIntroduction.................................................................................................................................................. 5I. Preliminaries........................................................................................................................................... 6II. Main theorem.......................................................................................................................................... 8III. The...

Remarks on D -integral complete multipartite graphs

Pavel Híc, Milan Pokorný (2016)

Czechoslovak Mathematical Journal

Similarity:

A graph is called distance integral (or D -integral) if all eigenvalues of its distance matrix are integers. In their study of D -integral complete multipartite graphs, Yang and Wang (2015) posed two questions on the existence of such graphs. We resolve these questions and present some further results on D -integral complete multipartite graphs. We give the first known distance integral complete multipartite graphs K p 1 , p 2 , p 3 with p 1 < p 2 < p 3 , and K p 1 , p 2 , p 3 , p 4 with p 1 < p 2 < p 3 < p 4 , as well as the infinite classes of distance integral...

On 𝓕-independence in graphs

Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer (2009)

Discussiones Mathematicae Graph Theory

Similarity:

Let be a set of graphs and for a graph G let α ( G ) and α * ( G ) denote the maximum order of an induced subgraph of G which does not contain a graph in as a subgraph and which does not contain a graph in as an induced subgraph, respectively. Lower bounds on α ( G ) and α * ( G ) are presented.

Iterated arc graphs

Danny Rorabaugh, Claude Tardif, David Wehlau, Imed Zaguia (2018)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

The arc graph δ ( G ) of a digraph G is the digraph with the set of arcs of G as vertex-set, where the arcs of δ ( G ) join consecutive arcs of G . In 1981, S. Poljak and V. Rödl characterized the chromatic number of δ ( G ) in terms of the chromatic number of G when G is symmetric (i.e., undirected). In contrast, directed graphs with equal chromatic numbers can have arc graphs with distinct chromatic numbers. Even though the arc graph of a symmetric graph is not symmetric, we show that the chromatic number...

On the structure of triangulated categories with finitely many indecomposables

Claire Amiot (2007)

Bulletin de la Société Mathématique de France

Similarity:

We study the problem of classifying triangulated categories with finite-dimensional morphism spaces and finitely many indecomposables over an algebraically closed field k . We obtain a new proof of the following result due to Xiao and Zhu: the Auslander-Reiten quiver of such a category 𝒯 is of the form Δ / G where Δ is a disjoint union of simply-laced Dynkin diagrams and G a weakly admissible group of automorphisms of Δ . Then we prove that for ‘most’ groups G , the category 𝒯 is standard, ...

Gorenstein dimension of abelian categories arising from cluster tilting subcategories

Yu Liu, Panyue Zhou (2021)

Czechoslovak Mathematical Journal

Similarity:

Let 𝒞 be a triangulated category and 𝒳 be a cluster tilting subcategory of 𝒞 . Koenig and Zhu showed that the quotient category 𝒞 / 𝒳 is Gorenstein of Gorenstein dimension at most one. But this is not always true when 𝒞 becomes an exact category. The notion of an extriangulated category was introduced by Nakaoka and Palu as a simultaneous generalization of exact categories and triangulated categories. Now let 𝒞 be an extriangulated category with enough projectives and enough injectives, and...