Related papers: Partial-dual genus polynomials and signed intersec…

In "A survey on the Turaev genus of knots," Champanerkar and Kofman propose several open questions. The first asks whether the polynomial whose coefficients count the number of quasi-trees of the all-A ribbon graph obtained from a diagram…

It is well known that the coefficients of the matching polynomial are unimodal. Unimodality of the coefficients (or their absolute values) of other graph polynomials have been studied as well. One way to prove unimodality is to prove…

Given a graph $G$, its genus polynomial is $\Gamma_G(x) = \sum_{k\geq 0} g_k(G)x^k$, where $g_k(G)$ is the number of 2-cell embeddings of $G$ in an orientable surface of genus $k$. The Log-Concavity Genus Distribution (LCGD) Conjecture…

We provide recipe theorems for the Bollob\`as and Riordan polynomial $\mathcal{R}$ defined on classes of ribbon graphs with half-edges introduced in arXiv:1310.3708[math.GT]. We also define a generalized transition polynomial $Q$ on this…

For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…

We study the neighborhood polynomial and the complexity of its computation for chordal graphs. The neighborhood polynomial of a graph is the generating function of subsets of its vertices that have a common neighbor. We introduce a…

In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for…

Graph-based semantic representations are valuable in natural language processing, where it is often simple and effective to represent linguistic concepts as nodes, and relations as edges between them. Several attempts has been made to find…

Mutual-visibility sets were motivated by visibility in distributed systems and social networks, and intertwine with several classical mathematical areas. Monotone properties of the variety of mutual-visibility sets, and restrictions of such…

In 2009 Chmutov introduced the idea of partial duality for embeddings of graphs in surfaces. We discuss some alternative descriptions of partial duality, which demonstrate the symmetry between vertices and faces. One is in terms of band…

We extend to infinite graphs the matroidal characterization of finite graph duality, that two graphs are dual iff they have complementary spanning trees in some common edge set. The naive infinite analogue of this fails. The key in an…

Let $\mathcal S$ be a set of monic degree $2$ polynomials over a finite field and let $C$ be the compositional semigroup generated by $\mathcal S$. In this paper we establish a necessary and sufficient condition for $C$ to be consisting…

The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…

Treewidth is a parameter that emerged from the study of minor closed classes of graphs (i.e. classes closed under vertex and edge deletion, and edge contraction). It in some sense describes the global structure of a graph. Roughly, a graph…

We introduce an additional structure on ribbon graphs, arrow structure. We extend the Bollob\'as-Riordan polynomial to ribbon graph with this structure. The extended polynomial satisfies the contraction-deletion relations and naturally…

Motivated by the definition of the edge elimination polynomial of a graph we define the covered components polynomial counting spanning subgraphs with respect to their number of components, edges and covered components. We prove a…

We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey numbers. We formalize situations in which we can use arbitrary families of…

The Bollobas-Riordan polynomial [Math. Ann. 323, 81 (2002)] extends the Tutte polynomial and its contraction/deletion rule for ordinary graphs to ribbon graphs. Given a ribbon graph $\cG$, the related polynomial should be computable from…

We give a method of generating strongly polynomial sequences of graphs, i.e., sequences $(H_{\mathbf{k}})$ indexed by a multivariate parameter $\mathbf{k}=(k_1,\ldots, k_h)$ such that, for each fixed graph $G$, there is a multivariate…

We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…