A Study On The Graph Formulation Of Union Closed Sets Conjecture
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908569974079488 |
|---|---|
| author | M, Nived J |
| author_facet | M, Nived J |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_02221 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Study On The Graph Formulation Of Union Closed Sets Conjecture M, Nived J Combinatorics 05C35 (Primary) 05D05 (Secondary) 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. |
| title | A Study On The Graph Formulation Of Union Closed Sets Conjecture |
| topic | Combinatorics 05C35 (Primary) 05D05 (Secondary) |
| url | https://arxiv.org/abs/2409.02221 |