Maximal independent sets, variants of chain/antichain principle and cofinal subsets without AC

Abstract

In set theory without the Axiom of Choice (AC), we observe new relations of the following statements with weak choice principles. 1. Every locally finite connected graph has a maximal independent set. 2. Every locally countable connected graph has a maximal independent set. 3. If in a partially ordered set all antichains are finite and all chains have size ${\aleph }_{\alpha }$, then the set has size ${\aleph }_{\alpha }$ if ${\aleph }_{\alpha }$ is regular. 4. Every partially ordered set has a cofinal well-founded subset. 5. If $G=(V_G,E_G)$ is a connected locally finite chordal graph, then there is an ordering $<$ of $V_G$ such that $\{w<v:\{w,v\}\in E_G\}$ is a clique for each $v\in V_G$.

Revised version

References in corpus (1)

• Chromatic number of the product of graphs, graph homomorphisms, Antichains and cofinal subsets of posets without AC

Cited by in corpus (2)

• On Erdos--Dushnik--Miller theorem without AC
• Brooks' type theorems for coloring parameters of locally finite graphs and Konig's Lemma