Related papers: A Note on "Regularity lemma for distal structures"
In this paper we show that the equivalences between certain properties of closed subanalytic sets proved by E. Bierstone and P. Milman in \cite{[BM-1]} hold for closed sets definable in quasianalytic o-minimal structures. In particular we…
In this paper, we use theory of rough set to study graphs using the concept of orbits. We investigate the indiscernibility partitions and approximations of graphs induced by orbits of graphs. We also study rough membership functions,…
A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the same intersection numbers for any edge taken as a root. In this paper we give some (combinatorial and algebraic) proofs of the fact that…
The theory of convergent graph sequences has been worked out in two extreme cases, dense graphs and bounded degree graphs. One can define convergence in terms of counting homomorphisms from fixed graphs into members of the sequence…
This is a work in progress, far from being in its final form whose purpose is to investigate thoroughly the structure of Berkovich analytic curves and its relation with the semi-stable reduction theorem (of which a new proof is given here,…
There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…
This paper is divided into two parts. The first is a review, through categorical lenses, of the classical theory of regular-singular differential systems over $C((x))$ and $\mathbb P^1_C\smallsetminus\{0,\infty\}$, where $C$ is…
There has been a great deal of research on graphs defined on algebraic structures in the last two decades. In this paper we begin an exploration of hypergraphs defined on algebraic structures, especially groups, to investigate whether this…
Graphs that are squares under the gluing algebra arise in the study of homomorphism density inequalities such as Sidorenko's conjecture. Recent work has focused on these homomorphism density applications. This paper takes a new perspective…
In 1988, Duval introduced the concept of directed strongly regular graphs, which can be viewed as a directed graph version of strongly regular graphs. Such directed graphs have similar structural and algebraic properties to strongly regular…
This is a new and short proof of the main theorem of classical structure tree theory. Namely, we show the existence of certain automorphism-invariant tree-decompositions of graphs based on the principle of removing finitely many edges. This…
Many natural and social systems develop complex networks, that are usually modelled as random graphs. The eigenvalue spectrum of these graphs provides information about their structural properties. While the semi-circle law is known to…
The paper provides the first constructions of strongly regular graphs and association schemes from weakly regular plateaued functions over finite fields of odd characteristic. We generalize the construction method of strongly regular graphs…
If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…
We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]
The aim of this paper is to generalize and improve two of the main model-theoretic results of "Stable group theory and approximate subgroups" by E. Hrushovski to the context of piecewise hyperdefinable sets. The first one is the existence…
We study the properties of finite graphs in which the ball of radius $r$ around each vertex induces a graph isomorphic to some fixed graph $F$. This is a natural extension of the study of regular graphs, and of the study of graphs of…
We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…
Let $G$ be a connected nonregular graphs of order $n$ with maximum degree $\Delta$ that attains the maximum spectral radius. Liu and Li (2008) proposed a conjecture stating that $G$ has a degree sequence $(\Delta,\ldots,\Delta,\delta)$ with…
An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…