Related papers: Using Edge-induced and Vertex-induced Subhypergrap…

We prove that for all $0\leq t\leq k$ and $d\geq 2k$, every graph $G$ with treewidth at most $k$ has a `large' induced subgraph $H$, where $H$ has treewidth at most $t$ and every vertex in $H$ has degree at most $d$ in $G$. The order of $H$…

The interaction between combinatorics and algebraic and differential geometry is very strong. While researching a problem of Hessian topology, we came across a series of identities of binomial coefficients, which are useful for proving a…

Given a finite, simple, vertex-weighted graph, we construct a graded associative (non-commutative) algebra, whose generators correspond to vertices and whose ideal of relations has generators that are graded commutators corresponding to…

Fix an integer $n \geq 1$, and consider the set of all connected finite simple graphs on $n$ vertices. For each $G$ in this set, let $I(G)$ denote the edge ideal of $G$ in the polynomial ring $R = K[x_1,\ldots,x_n]$. We initiate a study of…

In this paper we present an iterative construction of irreducible polynomials over finite fields based upon repeated applications of transforms induced by endomorphisms of odd prime degree of ordinary elliptic curves.

The first half of this paper is largely expository, wherein we present a systematic combinatorial approach to the theory of polynomial (semi)invariants and multilinear invariants of several vectors and covectors, for the classical groups.…

An old result of M\"uller and R\"odl states that a countable graph $G$ has a subgraph whose vertices all have infinite degree if and only if for any vertex labeling of $G$ by positive integers, an infinite increasing path can be found. They…

Given a hypergraph $H=(V,E)$, define for every edge $e\in E$ a linear expression with arguments corresponding with the vertices. Next, let the polynomial $p_H$ be the product of such linear expressions for all edges. Our main goal was to…

We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…

Let H = <n_1,...,n_e> be a numerical semigroup generated by e elements. Let k[H]= k[x_1, .... , x_e]/I_H = S/I_H be the semigroup ring of H over k. We define inverse polynomial J_{H,h} for h in H and express the defining ideal of I_H using…

For $t\geq 2$, the $t$-independence complex $\mathrm{Ind}_t(G)$ of a graph $G$ is the collection of all $A\subseteq V(G)$ such that each connected component of the induced subgraph $G[A]$ has at most $t-1$ vertices. The topology of…

In this paper, we study the independence polynomial $P_G(x)$ of a finite simple graph $G$, with emphasis on the evaluation at $x=-1$, symmetry, and its connection with the $h$-polynomial of the edge ideal of $G$. For big star graphs, we…

For a planar graph with a given f-vector $(f_{0}, f_{1}, f_{2}),$ we introduce a cubic polynomial whose coefficients depend on the f-vector. The planar graph is said to be real if all the roots of the corresponding polynomial are real. Thus…

The graph reconstruction conjecture asserts that every simple graph on at least three vertices is uniquely determined by its deck of vertex-deleted subgraphs. In this expository article we survey the conjecture and present an…

The neighborhood polynomial of graph $G$, denoted by $N(G,x)$, is the generating function for the number of vertex subsets of $G$ which are subsets of open neighborhoods of vertices in $G$. For any graph polynomial, it can be useful to…

We consider 3 (weighted) posets associated with a graph G - the poset P(G) of distinct induced unlabelled subgraphs, the lattice Omega(G) of distinct unlabelled graphs induced by connected partitions, and the poset Q(G) of distinct…

The set of homogeneous polynomials of degree $D$ is a topological space that contains the subspace $Hyp(D)$ constituted only by hyperbolic polynomials. In 2002, V. I. Arnold conjectured that the number of connected components of $Hyp (D)$…

Let M be a matroid on E, representable over a field of characteristic zero. We show that h-vectors of the following simplicial complexes are log-concave: 1. The matroid complex of independent subsets of E. 2. The broken circuit complex of…

Let $G=(V,E)$ be a digraph having no loops and no multiple arcs, with vertex set $V=\{v_1,v_2,\ldots,v_n\}$ and arc set $E=\{e_1,e_2,\ldots,e_m\}$. Denote the adjacency matrix and the vertex in-degree diagonal matrix of $G$ by…

We investigate arithmetic, geometric and combinatorial properties of symmetric edge polytopes. We give a complete combinatorial description of their facets. By combining Gr\"obner basis techniques, half-open decompositions and methods for…