Related papers: Flag f-vectors of colored complexes
We consider vertex colorings of graphs in which adjacent vertices have distinct colors. A graph is $s$-chromatic if it is colorable in $s$ colors and any coloring of it uses at least $s$ colors. The forcing chromatic number $F(G)$ of an…
Building on earlier work concerning the motives of $G$-bundles, we study the structure of motives associated with certain classes of $G$-varieties. In particular, we show that the corresponding motives lie within the category of mixed-Tate…
In this paper, we consider the morphisms from projective spaces to flag varieties. We show that the morphisms can only be constant under some special conditions. As a consequence, we prove that the splitting types of unsplit uniform…
It is proved that the Boolean algebra of rank n minimizes the flag f-vector among all graded lattices of rank n, whose proper part has nontrivial top-dimensional homology. The analogous statement for the flag h-vector is conjectured in the…
In contrary to widely spread view about the substantial delocalization of f electrons in heavy- fermion (h-f) compounds it is argued that h-f phenomena can be understood with localized f electrons. Then the role of crystal-field…
We introduce a family of forcing notions that are helpful in showing that certain graphs do not have countable colourings of (additive) Borel class alpha. We construct graphs that are ''weakly minimal'' for such colourings.
A natural explicit condition is given ensuring that an action of the multiplicative monoid of non-negative reals on a manifold F comes from homotheties of a vector bundle structure on F, or, equivalently, from an Euler vector field. This is…
A vertex coloring of a simplicial complex $\Delta$ is called a linear coloring if it satisfies the property that for every pair of facets $(F_1, F_2)$ of $\Delta$, there exists no pair of vertices $(v_1, v_2)$ with the same color such that…
Consider a coloring of a graph such that each vertex is assigned a fraction of each color, with the total amount of colors at each vertex summing to $1$. We define the fractional defect of a vertex $v$ to be the sum of the overlaps with…
Most applications of the hard Lefschetz theorem related to combinatorial properties of simplicial complexes involve their $h$-vectors. In the context of positivity properties involving $h$-vectors of flag spheres, $f$-vectors with a…
Consider the following two ways to colour the vertices of a graph where the requirement that adjacent vertices get distinct colours is relaxed. A colouring has "defect" $d$ if each monochromatic component has maximum degree at most $d$. A…
There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…
Starting from an unpublished conjecture of Kalai and from a conjecture of Eisenbud, Green and Harris, we study several problems relating h-vectors of Cohen-Macaulay, flag simplicial complexes and face vectors of simplicial complexes.
We study limits in 2-categories whose objects are categories with extra structure and whose morphisms are functors preserving the structure only up to a coherent comparison map, which may or may not be required to be invertible. This is…
Cyclic polytopes are generally known for being involved in the Upper Bound Theorem, but they have another extremal property which is less well known. Namely, the special shape of their f-vectors makes them applicable to certain…
We show that the magnetization in color-flavor locked superconductors can be so strong that homogeneous quark matter becomes metastable for a wide range of magnetic field values. This indicates that magnetic domains or other type of…
We study a weighted-set graph coloring problem in which one assigns $q$ colors to the vertices of a graph such that adjacent vertices have different colors, with a vertex weighting $w$ that either disfavors or favors a given subset of $s$…
The scattering of a fermion in the background of a sign potential is considered with a general mixing of vector and scalar Lorentz structures with the scalar coupling stronger than or equal to the vector coupling under the Sturm-Liouville…
We consider extensions of Brooks' classic theorem on vertex coloring where some colors cannot be used on certain vertices. In particular we prove that if $G$ is a connected graph with maximum degree $\Delta(G) \geq 4$ that is not a complete…
For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…