Fujita, Takaaki (2024) Reevaluating the Complementary Relationship between Single Ultrafilters and Linear Obstacles in Connectivity Systems. Asian Research Journal of Mathematics, 20 (8). pp. 69-75. ISSN 2456-477X
Fujita2082024ARJOM119750.pdf - Published Version
Download (321kB)
Abstract
The study of graph width parameters is highly significant in graph theory and combinatorics. Among these parameters, linear-width is particularly well-regarded and established. The concepts of Single Filter and Linear Obstacle pose challenges to achieving optimal linear-width in a connectivity system. In this concise paper, we present an alternative proof that establishes the cryptomorphism between Single Filter and Linear Obstacle. Although this proof may not be highly novel, we hope it will enhance the understanding of the intricate relationship between graph width parameters and ultrafilters.
Item Type: | Article |
---|---|
Subjects: | GO for STM > Mathematical Science |
Depositing User: | Unnamed user with email support@goforstm.com |
Date Deposited: | 29 Jul 2024 07:35 |
Last Modified: | 29 Jul 2024 07:35 |
URI: | http://archive.article4submit.com/id/eprint/2953 |