English

Crowns as retracts

Combinatorics 2025-05-08 v6

Abstract

We investigate crowns as retracts of finite posets. We define a multigraph F(P)\mathfrak{F}(P) reflecting the network of so-called improper 4-crowns contained in the extremal points of PP, and we show that PP contains a 4-crown as retract iff there exists a graph homomorphism of a certain type from F(P)\mathfrak{F}(P) to a multigraph C\mathfrak{C} not depending on PP. Additionally we show that PP contains a retract-crown with more than four points iff the poset induced by the extremal points of PP contains such a retract-crown. As practical result we develop and apply criteria for the systematic investigation of crowns as retracts. Most of our results are valid for infinite posets without infinite chains, too.

Cite

@article{arxiv.2111.09588,
  title  = {Crowns as retracts},
  author = {Frank a Campo},
  journal= {arXiv preprint arXiv:2111.09588},
  year   = {2025}
}

Comments

17 pages, 6 figures

R2 v1 2026-06-24T07:43:14.443Z