Chromatic symmetric functions and combinatorial polynomials are central constructs in modern algebraic combinatorics, extending classical graph invariants into rich algebraic frameworks. Originating ...
We develop the concept of partition categories, in order to extend the Mullin-Rota theory of binomial enumeration, and simultaneously to provide a natural setting for recent applications of the ...
Conjecture 1 (Tutte [2]): If G is a 2-edge-connected graph, then G admits a nowhere-zero 5-flow. If true, Conjecture 1 would imply that for every integer k > 4, the flow polynomial of any ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback