Related papers: Characteristic Polynomials and Hypergraph Generati…
In this paper, we count acyclic and strongly connected uniform directed labeled hypergraphs. For these combinatorial structures, we introduce a specific generating function allowing us to recover and generalize some results on the number of…
Modeling human trajectories in crowded environments is challenging due to the complex nature of pedestrian behavior and interactions. This paper proposes a geometric graph neural network (GNN) architecture that integrates domain knowledge…
Heaps of pieces were introduced by Viennot and have applications to algebraic combinatorics, theoretical computer science and statistical physics. In this paper, we how certain combinatorial properties of heaps studied by Fan and by…
The $H$-join of a family of graphs $\mathcal{G}=\{G_1, \dots, G_p\}$, also called the generalized composition, $H[G_1, \dots, G_p]$, where all graphs are undirected, simple and finite, is the graph obtained by replacing each vertex $i$ of…
A hypertree is a connected hypergraph without cycles. Further a hypertree is called an $r$-tree if, additionally, it is $r$-uniform. Note that 2-trees are just ordinary trees. A classical result states that for any 2-tree $T$ with…
Let $G$ be a simple graph and let $\mathcal{L}(G)$ be the free partially commutative Lie algebra associated to $G$. In this paper, using heaps of pieces, we prove an expression for the generalized $\textbf k$-chromatic polynomial of $G$ in…
A group $G$ is said to satisfy the finitely generated intersection property (f.g.i.p.) if the intersection of any two finitely generated subgroups of $G$ is again finitely generated. The aim of this article is to understand when the…
Recently, the theory of dense graph limits has received attention from multiple disciplines including graph theory, computer science, statistical physics, probability, statistics, and group theory. In this paper we initiate the study of the…
Graph homomorphism has been studied intensively. Given an m x m symmetric matrix A, the graph homomorphism function is defined as \[Z_A (G) = \sum_{f:V->[m]} \prod_{(u,v)\in E} A_{f(u),f(v)}, \] where G = (V,E) is any undirected graph. The…
In this paper we present a new Good Characterization of maximum genus of a graph which makes a common generalization of the works of Xuong, Liu, and Fu et al. Based on this, we find a new polynomially bounded algorithm to find the maximum…
Hypergraphs are used in machine learning to model higher-order relationships in data. While spectral methods for graphs are well-established, spectral theory for hypergraphs remains an active area of research. In this paper, we use random…
We initiate the study of a fundamental combinatorial problem: Given a capacitated graph $G=(V,E)$, find a shortest walk ("route") from a source $s\in V$ to a destination $t\in V$ that includes all vertices specified by a set…
We present the theory of multifunctions applied to graphs. Its interesting feature is that walks are recognized as iterations. We consider the graphs with arbitrary number of vertices which are determined by multifunctions. The mutually…
To a word $w$, we associate the rational function $\Psi_w = \prod (x_{w_i} - x_{w_{i+1}})^{-1}$. The main object, introduced by C. Greene to generalize identities linked to Murnaghan-Nakayama rule, is a sum of its images by certain…
Graph Generating Dependencies (GGDs) informally express constraints between two (possibly different) graph patterns which enforce relationships on both graph's data (via property value constraints) and its structure (via topological…
The combinatorial Hopf algebra on building sets $BSet$ extends the chromatic Hopf algebra of simple graphs. The image of a building set under canonical morphism to quasi-symmetric functions is the chromatic symmetric function of the…
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 construct a generating functional for the exact evalutation of a coherent representation of spin network amplitudes. This generating functional is defined for arbitrary graphs and depends only on a pair of spinors for each edge. The…
A spanning subgraph of a graph G is called a [0,2]-factor of G, if for . is a union of some disjoint cycles, paths and isolate vertices, that span the graph G. It is easy to get a [0,2]-factor of G and there would be many of [0,2]-factors…
We present a simple mechanism, which can be randomised, for constructing sparse $3$-uniform hypergraphs with strong expansion properties. These hypergraphs are constructed using Cayley graphs over $\mathbb{Z}_2^t$ and have vertex degree…