Related papers: An improvement to a result about graph isomorphism…
Answering a question of Diestel, we develop a topological notion of gammoids in infinite graphs which, unlike traditional infinite gammoids, always define a matroid. As our main tool, we prove for any infinite graph $G$ with vertex sets $A$…
Isomorphic factorizations of complete graphs originate from the seminal work of Frank Harary and collaborators, who initiated the systematic study of decompositions of complete graphs into pairwise isomorphic spanning subgraphs. In this…
In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…
A discrete map based on the sum of an integer's distinct primes factors and the sum of its other factors is defined and its iteration is studied.
We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the…
We define pure graphs, invertible graphs, and the notion of complementation of bicoloured graphs. The study of pure graphs is motivated by two conjectures about the transition systems of eulerian graphs and by the Cycle Double Cover…
In this note we prove a graph inequality based on the sizes of the common neighbourhoods. We also characterize the extremal graphs that achieve the equality. The result was first discovered as a consequence of the classical Forster's…
We give an especially simple proof of a theorem in graph theory that forms the key part of the solution to a problem in commutative algebra, on how to characterize the integral closure of a polynomial ring generated by quadratic monomials.
The criteria for determining graph isomorphism are crucial for solving graph isomorphism problems. The necessary condition is that two isomorphic graphs possess invariants, but their function can only be used to filtrate and subdivide…
Let X \subset R be a bounded set; we introduce a formula that calculates the upper graph box dimension of X (i.e.the supremum of the upper box dimension of the graph over all uniformly continuous functions defined on X). We demonstrate the…
The restoration of an additive function defined on P parallelepipeds via its derivative with respect to P parallelepipeds is studied. The obtained theorem is applied to the questions of uniqueness of multiple series with regard to Haar and…
Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where…
Factorization theorem plays the central role at high energy colliders to study standard model and beyond standard model physics. The proof of factorization theorem is given by Collins, Soper and Sterman to all orders in perturbation theory…
We consider the problem of covering a graph with a given number of induced subgraphs so that the maximum number of vertices in each subgraph is minimized. We prove NP-completeness of the problem, prove lower bounds, and give approximation…
While graphs and abstract data structures can be large and complex, practical instances are often regular or highly structured. If the instance has sufficient structure, we might hope to compress the object into a more succinct…
Factorization of numbers with the help of Gauss sums relies on an intimate relationship between the maxima of these functions and the factors. Indeed, when we restrict ourselves to integer arguments of the Gauss sum we profit from a…
Generalizations of Redfield's master theorem and superposition theorem are proved by using decomposition of the tensor product of several induced monomial representations of the symmetric group $S_d$ into transitive constituents. As direct…
We introduce the model-companion of the theory of fields expanded by a unary function for a multiplicative map, which we call ACFH. Among others, we prove that this theory is NSOP$_1$ and not simple, that the kernel of the map is a generic…
The main result concerns a bicategorical factorization system on the bicategory $\mathrm{Cat}$ of categories and functors. Each functor $A\xra{f} B$ factors up to isomorphism as $A\xra{j}E\xra{p}B$ where $j$ is what we call an ultimate…
In a recent paper, we studied the interaction between the automorphism group of a graph and its Tutte polynomial. More precisely, we proved that certain symmetries of graphs are clearly reflected by their Tutte polynomials. The purpose of…