For every poset, the noncommutative chromatic function of its incomparability graph is the omega image of the noncommutative Redei-Berge function, making the two theories interchangeable.
Some properties of the Redei-Berge function and related combinatorial Hopf algebras
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Stanley and Grinberg introduced the symmetric function associated to digraphs, called the Redei-Berge symmetric function. In [8] is shown that this symmetric function arises from a suitable structure of combinatorial Hopf algebra on digraphs. In this paper, we introduce two new combinatorial Hopf algebras of posets and permutations and define corresponding Redei-Berge functions for them. By using both theories, of symmetric functions and of combinatorial Hopf algebras, we prove many properties of the Redei-Berge function. These include some forms of deletion-contraction property, which make it similar to the chromatic symmetric function. We also find some invariants of digraphs that are detected by the Redei-Berge function.
citation-role summary
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
The connection between the chromatic function and the Redei-Berge function
For every poset, the noncommutative chromatic function of its incomparability graph is the omega image of the noncommutative Redei-Berge function, making the two theories interchangeable.