On uniquely partitionable relational structures and object systems

Jozef Bucko; Peter Mihók

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...

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.

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)$ .

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.

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, ...

Edit distance measure for graphs

Tomasz Dzido, Krzysztof Krzywdziński (2015)

Czechoslovak Mathematical Journal

Similarity:

In this paper, we investigate a measure of similarity of graphs similar to the Ramsey number. We present values and bounds for $g (n, l)$ , the biggest number $k$ guaranteeing that there exist $l$ graphs on $n$ vertices, each two having edit distance at least $k$ . By edit distance of two graphs $G$ , $F$ we mean the number of edges needed to be added to or deleted from graph $G$ to obtain graph $F$ . This new extremal number $g (n, l)$ is closely linked to the edit distance of graphs. Using probabilistic methods we show...

Yetter-Drinfeld-Long bimodules are modules

Daowei Lu, Shuan Hong Wang (2017)

Czechoslovak Mathematical Journal

Similarity:

Let $H$ be a finite-dimensional bialgebra. In this paper, we prove that the category $ℒℛ (H)$ of Yetter-Drinfeld-Long bimodules, introduced by F. Panaite, F. Van Oystaeyen (2008), is isomorphic to the Yetter-Drinfeld category $_{H \otimes H^{*}}^{H \otimes H^{*}} 𝒴𝒟$ over the tensor product bialgebra $H \otimes H^{*}$ as monoidal categories. Moreover if $H$ is a finite-dimensional Hopf algebra with bijective antipode, the isomorphism is braided. Finally, as an application of this category isomorphism, we give two results.

Bipartite coalgebras and a reduction functor for coradical square complete coalgebras

Justyna Kosakowska, Daniel Simson (2008)

Colloquium Mathematicae

Similarity:

Let C be a coalgebra over an arbitrary field K. We show that the study of the category C-Comod of left C-comodules reduces to the study of the category of (co)representations of a certain bicomodule, in case C is a bipartite coalgebra or a coradical square complete coalgebra, that is, C = C₁, the second term of the coradical filtration of C. If C = C₁, we associate with C a K-linear functor $ℍ_{C} : C - C o m o d \to H_{C} - C o m o d$ that restricts to a representation equivalence $ℍ_{C} : C - c o m o d \to H_{C} - c o m o d_{s p}^{•}$ , where $H_{C}$ is a coradical square complete hereditary...

Intrinsic linking and knotting are arbitrarily complex

Erica Flapan, Blake Mellor, Ramin Naimi (2008)

Fundamenta Mathematicae

Similarity:

We show that, given any n and α, any embedding of any sufficiently large complete graph in ℝ³ contains an oriented link with components Q₁, ..., Qₙ such that for every i ≠ j, $| l k (Q_{i}, Q_{j}) | \geq α$ and $| a ₂ (Q_{i}) | \geq α$ , where $a ₂ (Q_{i})$ denotes the second coefficient of the Conway polynomial of $Q_{i}$ .

Hall algebras of two equivalent extriangulated categories

Shiquan Ruan, Li Wang, Haicheng Zhang (2024)

Czechoslovak Mathematical Journal

Similarity:

For any positive integer $n$ , let $A_{n}$ be a linearly oriented quiver of type $A$ with $n$ vertices. It is well-known that the quotient of an exact category by projective-injectives is an extriangulated category. We show that there exists an extriangulated equivalence between the extriangulated categories $ℳ_{n + 1}$ and $ℱ_{n}$ , where $ℳ_{n + 1}$ and $ℱ_{n}$ are the two extriangulated categories corresponding to the representation category of $A_{n + 1}$ and the morphism category of projective representations of $A_{n}$ , respectively. As a...

Classes of hypergraphs with sum number one

Hanns-Martin Teichert (2000)

Discussiones Mathematicae Graph Theory

Similarity:

A hypergraph ℋ is a sum hypergraph iff there are a finite S ⊆ ℕ⁺ and d̲,d̅ ∈ ℕ⁺ with 1 < d̲ < d̅ such that ℋ is isomorphic to the hypergraph $ℋ_{d ̲, d ̅} (S) = (V,)$ where V = S and $= e \subseteq S : d ̲ < | e | < d ̅ \land \sum_{v \in e} v \in S$ . For an arbitrary hypergraph ℋ the sum number(ℋ ) is defined to be the minimum number of isolatedvertices $w ₁, . . ., w_{σ} \notin V$ such that $ℋ \cup w ₁, . . ., w_{σ}$ is a sum hypergraph. For graphs it is known that cycles Cₙ and wheels Wₙ have sum numbersgreater than one. Generalizing these graphs we prove for the hypergraphs ₙ and ₙ that under a certain condition...

Generalized list colourings of graphs

Mieczysław Borowiecki, Ewa Drgas-Burchardt, Peter Mihók (1995)

Discussiones Mathematicae Graph Theory

Similarity:

We prove: (1) that $c h_{P} (G) - χ_{P} (G)$ can be arbitrarily large, where $c h_{P} (G)$ and $χ_{P} (G)$ are P-choice and P-chromatic numbers, respectively, (2) the (P,L)-colouring version of Brooks’ and Gallai’s theorems.

Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs

Éric Sopena (2012)

Discussiones Mathematicae Graph Theory

Similarity:

The oriented chromatic number of an oriented graph $^{\to} G$ is the minimum order of an oriented graph $^{\to} H$ such that $^{\to} G$ admits a homomorphism to $^{\to} H$ . The oriented chromatic number of an undirected graph G is then the greatest oriented chromatic number of its orientations. In this paper, we introduce the new notion of the upper oriented chromatic number of an undirected graph G, defined as the minimum order of an oriented graph $^{\to} U$ such that every orientation $^{\to} G$ of G admits a homomorphism to $^{\to} U$ . We give...

Nearly complete graphs decomposable into large induced matchings and their applications

Noga Alon, Ankur Moitra, Benjamin Sudakov (2013)

Journal of the European Mathematical Society

Similarity:

We describe two constructions of (very) dense graphs which are edge disjoint unions of large induced matchings. The first construction exhibits graphs on $N$ vertices with $(\frac{N}{2}) - o (N^{2})$ edges, which can be decomposed into pairwise disjoint induced matchings, each of size $N^{1 - o (1)}$ . The second construction provides a covering of all edges of the complete graph $K_{N}$ by two graphs, each being the edge disjoint union of at most $N^{2 - δ}$ induced matchings, where $δ > 0, 076$ . This disproves (in a strong form) a conjecture of Meshulam,...

Limits and colimits in certain categories of spaces of continuous functions

Marvin W. Grossman

Similarity:

CONTENTSIntroduction................................................................................................................................................................................5§ 1. Notation and preliminaries.............................................................................................................................................6§ 2. Epimorphisms and monomorphisms.........................................................................................................................7§...

On distinguishing and distinguishing chromatic numbers of hypercubes

Werner Klöckl (2008)

Discussiones Mathematicae Graph Theory

Similarity:

The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d colors that is not preserved by any nontrivial automorphism. The restriction to proper labelings leads to the definition of the distinguishing chromatic number $χ_{D} (G)$ of G. Extending these concepts to infinite graphs we prove that $D (Q_{ℵ} ₀) = 2$ and $χ_{D} (Q_{ℵ} ₀) = 3$ , where $Q_{ℵ} ₀$ denotes the hypercube of countable dimension. We also show that $χ_{D} (Q ₄) = 4$ , thereby completing the investigation of finite hypercubes with respect to $χ_{D}$ . Our...

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...

Domination and independence subdivision numbers of graphs

Teresa W. Haynes, Sandra M. Hedetniemi, Stephen T. Hedetniemi (2000)

Discussiones Mathematicae Graph Theory

Similarity:

The domination subdivision number $s d_{γ} (G)$ of a graph is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number. Arumugam showed that this number is at most three for any tree, and conjectured that the upper bound of three holds for any graph. Although we do not prove this interesting conjecture, we give an upper bound for the domination subdivision number for any graph G in terms of the minimum degrees of...

A note on the independent domination number versus the domination number in bipartite graphs

Shaohui Wang, Bing Wei (2017)

Czechoslovak Mathematical Journal

Similarity:

Let $γ (G)$ and $i (G)$ be the domination number and the independent domination number of $G$ , respectively. Rad and Volkmann posted a conjecture that $i (G) / γ (G) \leq Δ (G) / 2$ for any graph $G$ , where $Δ (G)$ is its maximum degree (see N. J. Rad, L. Volkmann (2013)). In this work, we verify the conjecture for bipartite graphs. Several graph classes attaining the extremal bound and graphs containing odd cycles with the ratio larger than $Δ (G) / 2$ are provided as well.