Related papers: Weak regularity and finitely forcible graph limits
In this thesis we consider ordered graphs (that is, graphs with a fixed linear ordering on their vertices). We summarize and further investigations on the number of edges an ordered graph may have while avoiding a fixed forbidden ordered…
The theory of graphons is ultimately connected with the so-called cut norm. In this paper, we approach the cut norm topology via the weak* topology (when considering a predual of $L^{1}$-functions). We prove that a sequence…
Motivated by the study of greedy algorithms for graph coloring, Bernshteyn and Lee introduced a generalization of graph degeneracy, which is called weak degeneracy. In this paper, we show the lower bound of the weak degeneracy for…
This paper studies planar drawings of graphs in which each vertex is represented as a point along a sequence of horizontal lines, called levels, and each edge is either a horizontal segment or a strictly $y$-monotone curve. A graph is…
Greb\'ik and Rocha [Fractional Isomorphism of Graphons, Combinatorica 42, pp 365-404 (2022)] extended the well studied notion of fractional isomorphism of graphs to graphons. We prove that fractionally isomorphic graphons can be…
For an infinite class of finite graphs of unbounded size, we define a limit object, to be called a $\textit{wide limit}$, relative to some computationally restricted class of functions. The limit object is a first order Boolean-valued…
This is a report on a failed attempt to construct new graphs that are strongly regular with no triangles. The approach is based on the assumption that the second subconstituent has an equitable partition with four parts. For infinitely many…
A (finite or infinite) graph is called constructible if it may be obtained recursively from the one-point graph by repeatedly adding dominated vertices. In the finite case, the constructible graphs are precisely the cop-win graphs, but for…
In \cite{Elek} we proved that the limit of a weakly convergent sequence of finite graphs can be viewed as a graphing or a continuous field of infinite graphs. Thus one can associate a type $II_1$-von Neumann algebra to such graph sequences.…
Graphon is a nonparametric model that generates graphs with arbitrary sizes and can be induced from graphs easily. Based on this model, we propose a novel algorithmic framework called \textit{graphon autoencoder} to build an interpretable…
In many network problems, graphs may change by the addition of nodes, or the same problem may need to be solved in multiple similar graphs. This generates inefficiency, as analyses and systems that are not transferable have to be…
This paper addresses the behavior of the Lov\'asz number for dense random circulant graphs. The Lov\'asz number is a well-known semidefinite programming upper bound on the independence number. Circulant graphs, an example of a Cayley graph,…
This paper provides new observations on the Lov\'{a}sz $\theta$-function of graphs. These include a simple closed-form expression of that function for all strongly regular graphs, together with upper and lower bounds on that function for…
We associate to a graphon $\gamma$ the sequence of $W$-random graphs $(G_n(\gamma))_{n \geq 1}$. We say that the graphon is singular if, for any finite graph $F$, the homomorphism density $t(F,G_n(\gamma))$ has a variance of order…
A graph is $\ell$-reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting $\ell$ vertices. We prove that strongly regular graphs with at least six vertices are $2$-reconstructible.
Given a graph $H$ on vertex set $\{1,2,\cdots, n\}$ and a function $f:[0,1]^2 \rightarrow \mathbb{R}$, define \begin{align*} \|f\|_{H}:=\left\vert\int \prod_{ij\in E(H)}f(x_i,x_j)d\mu^{|V(H)|}\right\vert^{1/|E(H)|}, \end{align*} where $\mu$…
A sequence of graphs with diverging number of nodes is a dense graph sequence if the number of edges grows approximately as for complete graphs. To each such sequence a function, called graphon, can be associated, which contains information…
Given a finite, simple, connected graph $G=(V,E)$ with $|V|=n$, we consider the associated graph Laplacian matrix $L = D - A$ with eigenvalues $0 = \lambda_1 < \lambda_2 \leq \dots \leq \lambda_n$. One can also consider the same graph…
A triangle decomposition of a graph is a partition of its edges into triangles. A fractional triangle decomposition of a graph is an assignment of a non-negative weight to each of its triangles such that the sum of the weights of the…
Let $G$ be a simple graph with $2n$ vertices and a perfect matching. We denote by $f(G)$ and $F(G)$ the minimum and maximum forcing number of $G$, respectively. Hetyei obtained that the maximum number of edges of graphs $G$ with a unique…