Related papers: Flag f-vectors of colored complexes
We give a survey on the recent results and problems on the face enumeration of flag complexes and flag simplicial spheres, with an emphasis on the characterization of face vectors of flag complexes, several lower-bound type of conjectures…
Lurie's representability theorem gives necessary and sufficient conditions for a functor to be an almost finitely presented derived geometric stack. We establish several variants of Lurie's theorem, making the hypotheses easier to verify…
In this paper we prove that the category of parity complexes on the flag variety of a complex connected reductive group is a "graded version" of the category of tilting perverse sheaves on the flag variety of the dual group, for any field…
We give an example of a dynamical system which is mixing relative to one of its factors, but for which relative mixing of order three does not hold.
A thorough analysis is made of the Fourier coefficients for vector-valued modular forms associated to three-dimensional irreducible representations of the modular group. In particular, the following statement is verified for all but a…
A partition $(V_1,\ldots,V_k)$ of the vertex set of a graph $G$ with a (not necessarily proper) colouring $c$ is colourful if no two vertices in any $V_i$ have the same colour and every set $V_i$ induces a connected graph. The COLOURFUL…
The possibility of color ferromagnetism in an SU(2) gauge field model is investigated. The conditions allowing a stable color ferromagnetic state of the quark system in the chromomagnetic field occupying small domains are considered. A…
Color confinement is one of the central issues in QCD so that there are various interpretations of this feature. In this paper we have adopted the interpretation that colored particles are not subject to observation just because colored…
We determine several necessary and sufficient conditions for a closed almost-complex orbifold $Q$ with cyclic local groups to admit a nonvanishing vector field. These conditions are stated separately in terms of the orbifold Euler-Satake…
A graph $G$ is class II, if its chromatic index is at least $\Delta+1$. Let $H$ be a maximum $\Delta$-edge-colorable subgraph of $G$. The paper proves best possible lower bounds for $\frac{|E(H)|}{|E(G)|}$, and structural properties of…
We prove some conditions for the existence of higher dimensional algebraic fibering of group extensions. This leads to various corollaries on incoherence of groups and some geometric examples of algebraic fibers of type $F_n$ but not…
A graph $G$ with a list of colors $L(v)$ and weight $w(v)$ for each vertex $v$ is $(L,w)$-colorable if one can choose a subset of $w(v)$ colors from $L(v)$ for each vertex $v$, such that adjacent vertices receive disjoint color sets. In…
We prove a conjecture of A. S. Buch concerning the structure constants of the Grothendieck ring of a flag variety with respect to its basis of Schubert structure sheaves. For this, we show that the coefficients in this basis of the…
An edge-weighting of a graph is called vertex-coloring if the weighted degrees yield a proper vertex coloring of the graph. It is conjectured that for every graph without isolated edge, a vertex-coloring edge-weighting with the set {1,2,3}…
A strong edge-coloring of a graph $G$ is an assignment of colors to edges such that every color class induces a matching. We here focus on bipartite graphs whose one part is of maximum degree at most $3$ and the other part is of maximum…
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…
We investigate a class of 2-edge coloured bipartite graphs known as alternating signed bipartite graphs (ASBGs) that encode the information in alternating sign matrices. The central question is when a given bipartite graph admits an…
Classes with bounded rankwidth are MSO-transductions of trees and classes with bounded linear rankwidth are MSO-transductions of paths. These results show a strong link between the properties of these graph classes considered from the point…
We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a…
We popularize the question whether, for $m$ large enough, all $m$-uniform shift-chain hypergraphs are properly $2$-colorable. On the other hand, we show that for every $m$ some $m$-uniform shift-chains are not polychromatic $3$-colorable.