AI Chat AI Image Generator AI Video Text to Speech

Local structure of idempotent algebras II

06/18/2020

∙

by Andrei A. Bulatov, et al.

∙

∙

In this paper we continue the study of edge-colored graphs associated with finite idempotent algebras initiated in arXiv:2006.09599. We prove stronger connectivity properties of such graphs that will allows us to demonstrate several useful structural features of subdirect products of idempotent algebras such as rectangularity and 2-decomposition.

page 1

page 2

page 3

page 4

research

∙ 12/14/2020

Edge-connectivity and tree-structure in finite and infinite graphs

We show that every graph admits a canonical tree-like decomposition into...

0 Christian Elbracht, et al. ∙

research

∙ 10/10/2021

On the complexity of structure and substructure connectivity of graphs

The connectivity of a graph is an important parameter to measure its rel...

0 Huazhong Lü, et al. ∙

research

∙ 10/23/2019

Vertex Sparsifiers for c-Edge Connectivity

We show the existence of O(f(c)k) sized vertex sparsifiers that preserve...

0 Yang P. Liu, et al. ∙

research

∙ 02/13/2019

On the achromatic number of signed graphs

In this paper, we generalize the concept of complete coloring and achrom...

0 Dimitri Lajou, et al. ∙

research

∙ 05/16/2023

Decomposition of (infinite) digraphs along directed 1-separations

We introduce torsoids, a canonical structure in matching covered graphs,...

0 Nathan Bowler, et al. ∙

research

∙ 05/30/2021

The Sample Fréchet Mean of Sparse Graphs is Sparse

The availability of large datasets composed of graphs creates an unprece...

0 Daniel Ferguson, et al. ∙

research

∙ 11/23/2017

Regular decomposition of large graphs and other structures: scalability and robustness towards missing data

A method for compression of large graphs and matrices to a block structu...

0 Hannu Reittu, et al. ∙