Related papers: On Diophantine graphs
In this paper, we give the sharp upper bound for the number of vertices with positive curvature in a planar graph with nonnegative combinatorial curvature. Based on this, we show that the automorphism group of a planar---possibly…
Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…
A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases the diameter. Murty and Simon conjectured that the number of edges in a diameter two edge-critical graph on $n$ vertices is at most $\lfloor…
In this paper, we study the dot-product graphs in $\mathbb{F}_q^d$. We prove that if the size of the product of two adjacent sets is large enough, then the set of dot-product graphs has positive density. Our method is based on finite field…
We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…
A coloured graph is k-ultrahomogeneous if every isomorphism between two induced subgraphs of order at most k extends to an automorphism. A coloured graph is t-tuple regular if the number of vertices adjacent to every vertex in a set S of…
In this paper, we give an upper bound on the number of extensions of a triple to a quadruple for the Diophantine $m$-tuples with the property $D(4)$. We also confirm the conjecture of the uniqueness of such an extension in some special…
A majority edge-coloring of a graph without pendant edges is a coloring of its edges such that, for every vertex $v$ and every color $\alpha$, there are at most as many edges incident to $v$ colored with $\alpha$ as with all other colors.…
A Diophantine $m$-tuple over a finite field $\mathbb{F}_q$ is a set $\{a_1,\ldots, a_m\}$ of $m$ distinct elements in $\mathbb{F}_{q}^{*}$ such that $a_{i}a_{j}+1$ is a square in $\mathbb{F}_q$ whenever $i\neq j$. In this paper, we study…
Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…
We carry out a survey on curves defined over finite fields that are Diophantine stable; that is, with the property that the set of points of the curve is not altered under a proper field extension. First, we derive some general results of…
In a recent work on the bipartite Erd\H{o}s-R\'{e}nyi graph, Do et al. (2023) established upper bounds on the number of connected labeled bipartite graphs with a fixed surplus. We use some recent encodings of bipartite random graphs in…
Let $n$ be a non-zero integer. A set $S$ of positive integers is a Diophantine tuple with the property $D(n)$ if $ab+n$ is a perfect square for each $a,b \in S$ with $a \neq b$. It is of special interest to estimate the quantity $M_n$, the…
The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of…
We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.
Using the theory of Diophantine m-tuples, i.e. sets with the property that the product of its any two distinct elements increased by 1 is a perfect square, we construct an elliptic curve over Q(t) of rank at least 4 with three non-trivial…
In the paper we state and prove theorem describing the upper bound on number of the graphs that have fixed number of vertices |V| and can be colored with the fixed number of n colors. The bound relates both numbers using power of 2, while…
This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…
We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…
A graph is well-(edge-)dominated if every minimal (edge) dominating set is minimum. A graph is equimatchable if every maximal matching is maximum. We study these concepts on strong product graphs. We fully characterize well-edge-dominated…