Related papers: Unrestricted Red Size and Sign-Coherence
In this article, we will expand on the notions of maximal green and reddening sequences for quivers associated to cluster algebras. The existence of these sequences has been studied for a variety of applications related to Fomin and…
The set of forks is a class of quivers introduced by M. Warkentin, where every connected mutation-infinite quiver is mutation equivalent to infinitely many forks. Let $Q$ be a fork with $n$ vertices, and $\boldsymbol{w}$ be a…
We use semi-invariant pictures to prove two conjectures about maximal green sequences. First: if $Q$ is any acyclic valued quiver with an arrow $j\to i$ of infinite type then any maximal green sequence for $Q$ must mutate at $i$ before…
This note provides a quiver which does not admit a maximal green sequence, but which is mutation-equivalent to a quiver which does admit a maximal green sequence. The proof uses the `scattering diagrams' of Gross-Hacking-Keel-Kontsevich to…
In general, the existence of a maximal green sequence is not mutation invariant. In this paper we show that it is in fact mutation invariant for cluster quivers of finite mutation type. In particular, we show that a mutation finite cluster…
A subset $M$ of vertices in a graph $G$ is a mutual-visibility set if for any two vertices $u,v\in{M}$ there exists a shortest $u$-$v$ path in $G$ that contains no elements of $M$ as internal vertices. Let $\chi_{\mu}(G)$ be the least…
Totally proper quivers, introduced by S.~Fomin and the author arXiv:2406.03604, have many useful properties including powerful mutation invariants. We show that every mutation-acyclic quiver (i.e., a quiver that is mutation equivalent to an…
An ordered matching of size $n$ is a graph on a linearly ordered vertex set $V$, $|V|=2n$, consisting of $n$ pairwise disjoint edges. There are three different ordered matchings of size two on $V=\{1,2,3,4\}$: an alignment…
Gy\'arf\'as famously showed that in every $r$-coloring of the edges of the complete graph $K_n$, there is a monochromatic connected component with at least $\frac{n}{r-1}$ vertices. A recent line of study by Conlon, Tyomkyn, and the second…
For every even positive integer $k\ge 4$ let $f(n,k)$ denote the minimim number of colors required to color the edges of the $n$-dimensional cube $Q_n$, so that the edges of every copy of $k$-cycle $C_k$ receive $k$ distinct colors.…
Suppose that the vertices of a graph $G$ are colored with two colors in an unknown way. The color that occurs on more than half of the vertices is called the majority color (if it exists), and any vertex of this color is called a majority…
We introduce $\mathcal{Q}^N$ quivers and construct maximal green sequences for these quivers. We prove that any finite connected full subquiver of the quivers defined by Hernandez and Leclerc, arising in monoidal categorifications of…
In the paper we state and prove theorem describing the upper bound on number of the graphs that have fixed number of vertices |V| and can be colored with the fixed number of n colors. The bound relates both numbers using power of 2, while…
A cactus is a connected graph in which each edge is contained in at most one cycle. We generalize the concept of cactus graphs, i.e., a $k$-cactus is a connected graph in which each edge is contained in at most $k$ cycles where $k\ge 1$. It…
A matching $M$ in a graph $G$ is uniquely restricted if no other matching in $G$ covers the same set of vertices. We prove that any connected subcubic graph with $n$ vertices and girth at least $5$ contains a uniquely restricted matching of…
Maximal green sequences are particular sequences of quiver mutations appearing in the context of quantum dilogarithm identities and supersymmetric gauge theory. Interpreting maximal green sequences as paths in various natural posets arising…
We show that the mutation class of a finite quiver without oriented cycles is finite if and only is the quiver is either Dynkin, extended Dynkin or has at most two vertices.
A hereditary property of quivers is a property preserved by restriction to any full subquiver. Similarly, a mutation-invariant property of quivers is a property preserved by mutation. Using forks, a class of quivers developed by M.…
Gy\'arf\'as conjectured in 2011 that every $r$-edge-colored $K_n$ contains a monochromatic component of bounded ("perhaps three") diameter on at least $n/(r-1)$ vertices. Letzter proved this conjecture with diameter four. In this note we…
In this note we asymptotically determine the maximum number of hyperedges possible in an $r$-uniform, connected $n$-vertex hypergraph without a Berge path of length $k$, as $n$ and $k$ tend to infinity. We show that, unlike in the graph…