Related papers: Linear chord diagrams on two intervals

We study graphs which admit an acyclic orientation that contains an out-branching and in-branching which are arc-disjoint (such an orientation is called {\bf good}). A {\bf 2T-graph} is a graph whose edge set can be decomposed into two…

Researchers have proposed various methods of incorporating more structured information into the design of Graph Neural Networks (GNNs) to enhance their expressiveness. However, these methods are either computationally expensive or lacking…

We prove Hadwiger's Conjecture for $\{\text{co-claw}, \text{co-gem}\}$-free graphs and $\{\text{fork}, \text{antifork}\}$-free graphs, where the co-claw is the disjoint union of a triangle and a vertex, the co-gem is the disjoint union of a…

Let $f,g:(\mathbb{R}^n,0)\rightarrow (\mathbb{R},0)$ be analytic functions. We will show that if $\nabla f(0)=0$ and $g-f \in (f)^{r+2}$ then $f$ and $g$ are $C^r$-right equivalent, where $(f)$ denote ideal generated by $f$ and $r\in…

In two recent works \cite{BMM,BK}, it has been shown that the counting generating functions (CGF) for the 23 walks with small steps confined in a quadrant and associated with a finite group of birational transformations are holonomic, and…

Two series of W-algebras with two generators are constructed from chiral vertex operators of a free field representation. If $c = 1 - 24k$, there exists a W(2,3k) algebra for k in $Z_{+}/2$ and a W(2,8k) algebra for k in $Z_{+}/4$. All…

The zero locus of a function f on a graph G is defined as the graph with vertex set consisting of all complete subgraphs of G, on which f changes sign and where x,y are connected if one is contained in the other. For d-graphs, finite simple…

The cogrowth series of a group with respect to a finite generating set is an important combinatorial quantity that seems very difficult to compute exactly, as evidenced by the scarcity of known examples. In this paper, we give a particular…

Let $p$ be an odd prime. From a simple undirected graph $G$, through the classical procedures of Baer (Trans. Am. Math. Soc., 1938), Tutte (J. Lond. Math. Soc., 1947) and Lov\'asz (B. Braz. Math. Soc., 1989), there is a $p$-group $P_G$ of…

Let $\mathcal{C}$ be a family of edge-colored graphs. A $t$-edge colored graph $G$ is $(\mathcal{C}, t)$-saturated if $G$ does not contain any graph in $\mathcal{C}$ but the addition of any edge in any color in $[t]$ creates a copy of some…

Using skein valued holomorphic curve counting techniques, we give a flow loop formula for the skein valued partition function of the Lagrangian knot complement of a fibered knot (of the $A$-model open topological strings with Lagrangian…

The functional graph of a function $g:X\rightarrow X$ is the directed graph with vertex set $X$ the edges of which are of the form $x\rightarrow g(x)$ for $x\in X$. Functional graphs are heavily studied because they allow one to understand…

Let $F(G)$ be the number of forests of a graph $G$. Similarly let $C(G)$ be the number of connected spanning subgraphs of a connected graph $G$. We bound $F(G)$ and $C(G)$ for regular graphs and for graphs with fixed average degree. Among…

We show that every edge in a 2-edge-connected planar cubic graph is either contained in a 2-edge-cut or is a chord of some cycle that is contained in a 2-factor of the graph. As a consequence, we show that every edge in a cyclically…

A nut graph is a simple graph whose adjacency matrix has the eigenvalue~0 with multiplicity~1 such that its corresponding eigenvector has no zero entries. Motivated by a question of Fowler et al.~[\emph{Disc. Math. Graph Theory} 40 (2020),…

In this work we consider a family of function classes constructed by means of the Gauss hypergeometric function $_2F_1(1,1;2;z) =-\frac{\log(1-z)}{z}$. We demonstrate that this family, in fact, constitutes classes of analytic functions…

A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if all maximal independent sets are of the same weight. For…

For any positive integer $k$, the reconfiguration graph for all $k$-colorings of a graph $G$, denoted by $\mathcal{R}_k(G)$, is the graph where vertices represent the $k$-colorings of $G$, and two $k$-colorings are joined by an edge if they…

Graph data structures are fundamental for studying connected entities. With an increase in the number of applications where data is represented as graphs, the problem of graph generation has recently become a hot topic. However, despite its…

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…