Coloring complexes and combinatorial Hopf monoids
From MaRDI portal
Publication:2102693
Abstract: We generalize the notion of a coloring complex of a graph to linearized combinatorial Hopf monoids. We determine when a linearized combinatorial Hopf monoid has such a construction, and discover some inequalities that are satisfied by the quasisymmetric function invariants associated to the combinatorial Hopf monoid. We show that the collection of all such coloring complexes forms a linearized combinatorial Hopf monoid, which is the terminal object in the category of combinatorial Hopf monoids with convex characters. We also study several examples of combinatorial Hopf monoids.
Recommendations
- Hom complexes and hypergraph colorings
- scientific article; zbMATH DE number 1304224
- Colourful theorems and indices of homomorphism complexes
- Cohomology of colorings of cycles
- Combinatorial Hopf algebras of simplicial complexes
- Hopf Monoids and Generalized Permutahedra
- Multi-colour braid-monoid algebras
- Hopf monoids of ordered simplicial complexes
- Hopf Algebras of Combinatorial Structures
- Coloring complexes and arrangements
Cites Work
- scientific article; zbMATH DE number 3908445 (Why is no real title available?)
- scientific article; zbMATH DE number 3724452 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 3895079 (Why is no real title available?)
- A quasisymmetric function for matroids
- A self paired Hopf algebra on double posets and a Littlewood-Richardson rule
- A symmetric function generalization of the chromatic polynomial of a graph
- Balanced Cohen-Macaulay Complexes
- Coloring complexes and arrangements
- Combinatorial Hopf algebras and generalized Dehn–Sommerville relations
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- Double posets and the antipode of QSym
- Enumeration of Golomb rulers and acyclic orientations of mixed graphs
- Enumeration of points, lines, planes, etc.
- Flawlessness of \(h\)-vectors of broken circuit complexes
- Hopf monoids in the category of species
- Linear inequalities for flags in graded partially ordered sets
- Link complexes of subspace arrangements
- Monoidal functors, species and Hopf algebras
- New invariants for permutations, orders and graphs
- On posets and Hopf algebras
- On weak chromatic polynomials of mixed graphs
- Strong forms of linearization for Hopf monoids in species
- The coloring ideal and coloring complex of a graph
- The subchromatic number of a graph
- Valuations and the Hopf Monoid of Generalized Permutahedra
- What can be said about pure O-sequences?
- Whitney Number Inequalities for Geometric Lattices
Cited In (8)
- Combinatorial Hopf algebras of simplicial complexes
- Unimodality and coloured hook factorisation
- Chromatic quasisymmetric class functions of linearized combinatorial Hopf monoids
- Combinatorial Hopf algebras of simplicial complexes.
- Title not available (Why is no real title available?)
- Chromatic quasisymmetric class functions for combinatorial Hopf monoids
- On Cohen-Macaulay Hopf monoids in species
- Hom complexes and hypergraph colorings
This page was built for publication: Coloring complexes and combinatorial Hopf monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102693)