Discussion on Maximal Edge-ideal in Graph Theory
Year: 2025
Type: article
Abstract: The exploration of width parameters within the fields of graph theory and algebra has garnered significant interest. Among these parameters, tree-cut decomposition stands out as a vital metric. The "Edge-Tangle" concept is intrinsically linked to the width parameter known as "tree-cut width" in graph theory. In this paper, we introduce a new definition termed Maximal Edge-Ideal for graphs and demonstrate their equivalence to Edge-Tangles.
Author: Takaaki Fujita
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4408626122
