Related papers: Extending Partial Representations of Unit Circular…
In this paper, we will evaluate the performance of graph neural networks in two distinct domains: computer vision and reinforcement learning. In the computer vision section, we seek to learn whether a novel non-redundant representation for…
This paper deals with the problem of finding, for a given graph and a given natural number k, a subgraph of k nodes with a maximum number of edges. This problem is known as the k-cluster problem and it is NP-hard on general graphs as well…
In recent years, Dynamic Graph (DG) representations have been increasingly used for modeling dynamic systems due to their ability to integrate both topological and temporal information in a compact representation. Dynamic graphs allow to…
A generalization of recent group-theoretic matrix multiplication algorithms to an analogue of the theory of partial matrix multiplication is presented. We demonstrate that the added flexibility of this approach can in some cases improve…
This paper gives a complete classification of the unitary irreducible spherical representations of split real and p-adic groups. The results were obtained around 2000, the changes to the new version are expository.
NP-complete problems should be hard on some instances but those may be extremely rare. On generic instances many such problems, especially related to random graphs, have been proven easy. We show the intractability of random instances of a…
The study of extremal problems for set mappings has a long history. It was introduced in 1958 by Erd\H{o}s and Hajnal, who considered the case of cliques in graphs and hypergraphs. Recently, Caro, Patk\'os, Tuza and Vizer revisited this…
We prove that the combinatorial optimization problem of determining the hull number of a partial cube is NP-complete. This makes partial cubes the minimal graph class for which NP-completeness of this problem is known and improves some…
Theoretical analyses for graph learning methods often assume a complete observation of the input graph. Such an assumption might not be useful for handling any-size graphs due to the scalability issues in practice. In this work, we develop…
This paper represents a significant leap forward in the problem of enumerating vertex-transitive graphs. Recent breakthroughs on symmetry of Cayley (di)graphs show that almost all finite Cayley (di)graphs have the smallest possible…
In the work [$\mathcal{O}(m\cdot n)$ algorithms for the recognition and isomorphism problems on circular-arc graphs, SIAM J. Comput. 24(3), 411--439, (1995)], Wen-Lian Hsu claims three results concerning the class of circular-arc graphs: -…
Graph neural network (GNN) is effective to model graphs for distributed representations of nodes and an entire graph. Recently, research on the expressive power of GNN attracted growing attention. A highly-expressive GNN has the ability to…
We study unit disk visibility graphs, where the visibility relation between a pair of geometric entities is defined by not only obstacles, but also the distance between them. That is, two entities are not mutually visible if they are too…
The crossing number of a graph is the least number of crossings over all drawings of the graph in the plane. Computing the crossing number of a given graph is NP-hard, but fixed-parameter tractable (FPT) with respect to the natural…
The First and Second Representation Theorem for sign-indefinite quadratic forms are extended. We include new cases of unbounded forms associated with operators that do not necessarily have a spectral gap around zero. The kernel of the…
The first part (Sections 1-6) of this paper is a survey of some of the recent developments in the theory of Dirac cohomology, especially the relationship of Dirac cohomology with (g,K)-cohomology and nilpotent Lie algebra cohomology; the…
We introduce a theory of cyclic Kummer extensions of commutative rings for partial Galois extensions of finite groups, extending some of the well-known results of the theory of Kummer extensions of commutative rings developed by A. Z.…
Hypergraphs are an invaluable tool to understand many hidden patterns in large data sets. Among many ways to represent hypergraph, one useful representation is that of weighted clique expansion. In this paper, we consider this…
The generalization of the Oberwolfach Problem, proposed by J. Liu in 2000, asks for a uniform $2$-factorization of the complete multipartite graph $K_{m\times n}$. Here we focus our attention on $2$-factorizations regular under the cyclic…
Many applications in graph theory are motivated by routing or flow problems. Among these problems is Steiner Orientation: given a mixed graph G (having directed and undirected edges) and a set T of k terminal pairs in G, is there an…