Abstract:The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union closed family of sets, there exists at least one element that appears in at least half of the sets within the family.
We establish the graph-theoretic version of certain set-theoretic results by connecting the set-based and graph-based formulations. We then prove a theorem in which we investigate the conjecture for graphs, focusing on their decompositions and the position of certain pendant vertices. As a result, we extend the validity of the conjecture to a broader class of graph structures.
From: Nived J M [view email]
[v1]
Tue, 3 Sep 2024 18:47:48 UTC (208 KB)
[v2]
Mon, 11 Nov 2024 02:41:31 UTC (747 KB)
[v3]
Mon, 29 Sep 2025 16:59:47 UTC (1,220 KB)
[v4]
Wed, 1 Oct 2025 08:29:01 UTC (1,220 KB)
[v5]
Sun, 19 Jul 2026 09:26:16 UTC (1,220 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。