Distinguishing colorings, proper colorings, and covering properties without the Axiom of Choice
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918100323008512 |
|---|---|
| author | Banerjee, Amitayu Molnár, Zalán Gopaulsingh, Alexa |
| author_facet | Banerjee, Amitayu Molnár, Zalán Gopaulsingh, Alexa |
| contents | We work with simple graphs in ZF (Zermelo--Fraenkel set theory without the Axiom of Choice (AC)) and assume that the sets of colors can be either well-orderable or non-well-orderable to prove that the following statements are equivalent to Kőnig Lemma: (a) Any infinite locally finite connected graph G such that the minimum degree of G is greater than k, has a chromatic number for any fixed integer k greater than or equal to 2. (b) Any infinite locally finite connected graph has a chromatic index. (c) Any infinite locally finite connected graph has a distinguishing number. (d) Any infinite locally finite connected graph has a distinguishing index.
Our results strengthen some results of Stawiski from a recent paper on the role of the Axiom of Choice in proper and distinguishing colorings since he assumed that the sets of colors can be well-ordered.
We also formulate new conditions for the existence of irreducible proper coloring, minimal edge cover, maximal matching, and minimal dominating set in connected bipartite graphs and locally finite connected graphs, which are either equivalent to AC or Kőnig Lemma. Moreover, we show that if the Axiom of Choice for families of 2 element sets holds, then the Shelah--Soifer graph has a minimal dominating set. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2309_06116 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Distinguishing colorings, proper colorings, and covering properties without the Axiom of Choice Banerjee, Amitayu Molnár, Zalán Gopaulsingh, Alexa Combinatorics Logic 03E25 (Primary) 05C63, 05C15, 05C69 (Secondary) We work with simple graphs in ZF (Zermelo--Fraenkel set theory without the Axiom of Choice (AC)) and assume that the sets of colors can be either well-orderable or non-well-orderable to prove that the following statements are equivalent to Kőnig Lemma: (a) Any infinite locally finite connected graph G such that the minimum degree of G is greater than k, has a chromatic number for any fixed integer k greater than or equal to 2. (b) Any infinite locally finite connected graph has a chromatic index. (c) Any infinite locally finite connected graph has a distinguishing number. (d) Any infinite locally finite connected graph has a distinguishing index. Our results strengthen some results of Stawiski from a recent paper on the role of the Axiom of Choice in proper and distinguishing colorings since he assumed that the sets of colors can be well-ordered. We also formulate new conditions for the existence of irreducible proper coloring, minimal edge cover, maximal matching, and minimal dominating set in connected bipartite graphs and locally finite connected graphs, which are either equivalent to AC or Kőnig Lemma. Moreover, we show that if the Axiom of Choice for families of 2 element sets holds, then the Shelah--Soifer graph has a minimal dominating set. |
| title | Distinguishing colorings, proper colorings, and covering properties without the Axiom of Choice |
| topic | Combinatorics Logic 03E25 (Primary) 05C63, 05C15, 05C69 (Secondary) |
| url | https://arxiv.org/abs/2309.06116 |