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

Let $G=(V(G),E(G))$ be a graph with set of vertices $V(G)$ and set of edges $E(G)$. A subset $S$ of $E(G)$ is called a $k$-nearly independent edge subsets if there are exactly $k$ pairs of elements of $S$ that share a common end. $Z_k(G)$…

The algebra of basic covers of a graph G, denoted by \A(G), was introduced by Juergen Herzog as a suitable quotient of the vertex cover algebra. In this paper we show that if the graph is bipartite then \A(G) is a homogeneous algebra with…

We prove a version of Kontsevich's formality theorem for two subspaces (branes) of a vector space $X$. The result implies in particular that the Kontsevich deformation quantizations of $\mathrm{S}(X^*)$ and $\wedge(X)$ associated with a…

A Koszul-Vinberg manifold is a manifold $M$ endowed with a pair $(\nabla,h)$ where $\nabla$ is a flat connection and $h$ is a symmetric bivector field satisfying a generalized Codazzi equation. The geometry of such manifolds could be seen…

Feder and Subi conjectured that for any $2$-coloring of the edges of the $n$-dimensional cube, we can find an antipodal pair of vertices connected by a path that changes color at most once. We discuss the case of random colorings, and we…

In this article, we introduce basic aspects of the algebraic notion of Koszul duality for a physics audience. We then review its appearance in the physical problem of coupling QFTs to topological line defects, and illustrate the concept…

In this paper we describe all possible reduced complete intersection sets of points on Veronese surfaces. We formulate a conjecture for the general case of complete intersection subvarieties of any dimension and we prove it in the case of…

In this article, we have defined nil clean graph of a ring $R$. The vertex set is the ring $R$, two ring elements $a$ and $b$ are adjacent if and only if $a + b$ is nil clean in $R$. Graph theoretic properties like girth, dominating set,…

Scale-free percolation is a percolation model on $\mathbb{Z}^d$ which can be used to model real-world networks. We prove bounds for the graph distance in the regime where vertices have infinite degrees. We fully characterize transience vs.…

Let $G = (V, E)$ be a graph with the vertex set $V (G)$ and edge set $E(G)$. The Sombor index of $G$, $SO(G)$, is defined as $\sum_{uv\in E(G)} \sqrt{deg(u)^2 + deg(v)^2}$, where $deg(u)$ is the degree of vertex $u$ in $V (G)$. The clean…

One of Erdos's conjectures states that every triangle-free graph on $n$ vertices has an induced subgraph on $n/2$ vertices with at most $n^2/50$ edges. We report several partial results towards this conjecture. In particular, we establish…

Associated to any uniform finite layered graph Gamma there is a noncommutative graded quadratic algebra A(Gamma) given by a construction due to Gelfand, Retakh, Serconek and Wilson. It is natural to ask when these algebras are Koszul.…

We give necessary and sufficient conditions for strong Koszulness of toric rings associated with the stable set polytope of graphs.

We prove that for every graph $H$, there exists $\varepsilon>0$ such that every $n$-vertex graph with no vertex-minors isomorphic to $H$ has a pair of disjoint sets $A$, $B$ of vertices such that $|A|, |B|\ge \varepsilon n$ and $A$ is…

Working in a polynomial ring $S=\mathbf{k}[x_1,\ldots,x_n]$ where $\mathbf{k}$ is an arbitrary commutative ring with $1$, we consider the $d^{th}$ Veronese subalgebras $R=S^{(d)}$, as well as natural $R$-submodules $M=S^{(\geq r, d)}$…

The complementary second Zagreb index of a graph $G$ is defined as $cM_2(G)=\sum_{uv\in E(G)}|(d_u(G))^2-(d_v(G))^2|$, where $d_u(G)$ denotes the degree of a vertex $u$ in $G$ and $E(G)$ represents the edge set of $G$. Let $G^*$ be a graph…

The analysis of several algorithms and data structures can be framed as a peeling process on a random hypergraph: vertices with degree less than k are removed until there are no vertices of degree less than k left. The remaining hypergraph…

In a directed graph, a kernel is a subset of vertices that is both stable and absorbing. Not all digraphs have a kernel, but a theorem due to Boros and Gurvich guarantees the existence of a kernel in every clique-acyclic orientation of a…

We show the quarter of a century old conjecture that every $K_4$-free graph with $n$ vertices and $\lfloor n^2/4 \rfloor +k$ edges contains $k$ pairwise edge disjoint triangles.

Let V be a plane smooth cubic curve over a finitely generated field k. The Mordell-Weil theorem for V states that there is a finite subset P \subset V(k) such that the whole V(k) can be obtained from P by drawing secants and tangents…