Related papers: A Koszul filtration for the second squarefree Vero…

We establish a technique to prove that a Koszul graded ring is prime or a domain using information about its Koszul dual. This is based on a general categorical result that expands on methods of J.Y. Guo, which proves that certain orbital…

The Veronese subalgebra $A_0$ of degree $d\geq 2$ of the polynomial algebra $A=K[x_1,x_2,\ldots,x_n]$ over a field $K$ in the variables $x_1,x_2,\ldots,x_n$ is the subalgebra of $A$ generated by all monomials of degree $d$ and the Veronese…

A $k$-bisection of a multigraph $G$ is a partition of its vertex set into two parts of the same cardinality such that every component of each part has at most $k$ vertices. Cui and Liu shown that every claw-free cubic multigraph contains a…

For several natural filtrations of a free group S we express the n-th term of the filtration as the intersection of all kernels of homomorphisms from S to certain groups of upper-triangular unipotent matrices. This generalizes a classical…

A graph is prime (with respect to the split decomposition) if its vertex set does not admit a partition (A,B) (called a split) with |A|, |B| >= 2 such that the set of edges joining A and B induces a complete bipartite graph. We prove that…

Motivated by questions about square-free monomial ideals in polynomial rings, in 2010 Francisco et al. conjectured that for every positive integer k and every k-critical (i.e., critically k-chromatic) graph, there is a set of vertices whose…

The Subset Feedback Vertex Set problem generalizes the classical Feedback Vertex Set problem and asks, for a given undirected graph $G=(V,E)$, a set $S \subseteq V$, and an integer $k$, whether there exists a set $X$ of at most $k$ vertices…

In this paper we show that the relative canonical sheaf of a relatively minimal fibration of curves over a curve is semi-ample ; in fact, its m-tensored product is base point free for any m > 1. We use Koszul cohomology with it to prove…

A vertex coloring of a given simple graph $G=(V,E)$ with $k$ colors ($k$-coloring) is a map from its vertex set to the set of integers $\{1,2,3,\dots, k\}$. A coloring is called perfect if the multiset of colors appearing on the neighbours…

We show that the minimum number of orientations of the edges of the n-vertex complete graph having the property that every triangle is made cyclic in at least one of them is $\lceil\log_2(n-1)\rceil$. More generally, we also determine the…

We consider spherical quadrangulations -- spherical embeddings of multigraphs, possibly with loops, so that every face has boundary walk of length 4 -- in which all vertices have degree 3 or 4. Interpreting each degree 4 vertex as a…

We define an analogue of the Arnold surface for odd degree flexible curves, and we use it to double branch cover $Q$-flexible embeddings, where $Q$-flexible is a condition to be added to the classical notion of a flexible curve. This allows…

A \emph{$k$--bisection} of a bridgeless cubic graph $G$ is a $2$--colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes have order…

This paper gives an approximate result related to Seymour's Second Neighborhood conjecture, that is, for any $m$-free digraph $G$, there exists a vertex $v\in V(G)$ and a real number $\lambda_m$ such that $d^{++}(v)\geq \lambda_m d^+(v)$,…

For any positive integer $n$, we exhibit a cofinite subgroup $\Gamma_n$ of the mapping class group of a surface of genus at most two such that $\Gamma_n$ admits an epimorphism onto a free group of rank $n$. We conclude that…

We show that all two-bridge knot and link complements are virtually fibered. We also show that spherical Montesinos knot and link complements are virtually fibered. This is accomplished by showing that such knot complements are finitely…

For any group G, we define a new characteristic series related to the derived series, that we call the torsion-free derived series of G. Using this series and the Cheeger-Gromov rho-invariant, we obtain new real-valued homology cobordism…

We characterize the vertices belonging to all minimum dominating sets, to some minimum dominating sets but not all, and to no minimum dominating set. We refine this characterization for some well studied sub-classes of graphs: chordal,…

We prove that every properly edge-colored $n$-vertex graph with average degree at least $100(\log n)^2$ contains a rainbow cycle, improving upon $(\log n)^{2+o(1)}$ bound due to Tomon. We also prove that every properly colored $n$-vertex…

Given a coloring of the edges of the complete graph on n vertices in k colors, by considering the neighbors of an arbitrary vertex it follows that there is a monochromatic diameter two subgraph on at least 1+(n-1)/k vertices. We show that…