Related papers: Forcing Generalized Quasirandom Graphs Efficiently

The Kohayakawa-Nagle-R\"odl-Schacht conjecture roughly states that every sufficiently large locally $d$-dense graph $G$ on $n$ vertices must contain at least $(1-o(1))d^{|E(H)|}n^{|V(H)|}$ copies of a fixed graph $H$. Despite its important…

We give variants of the Krein bound and the absolute bound for graphs with a spectrum similar to that of a strongly regular graph. In particular, we investigate what we call approximately strongly regular graphs. We apply our results to…

A quasi-strongly regular graph of grade $p$ with parameters $(n, k, a; c_1, \ldots, c_p)$ is a $k$-regular graph of order $n$ such that any two adjacent vertices share $a$ common neighbours and any two non-adjacent vertices share $c_{i}$…

We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchangeable measures on the unit square. We call our limits…

The semi-random graph process is a single-player game that begins with an empty graph on $n$ vertices. In each round, a vertex $u$ is presented to the player independently and uniformly at random. The player then adaptively selects a vertex…

There are typically several nonisomorphic graphs having a given degree sequence, and for any two degree sequence terms it is often possible to find a realization in which the corresponding vertices are adjacent and one in which they are…

Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have…

Half graphs and their variants, such as ladders, semi-ladders and co-matchings, are combinatorial objects that encode total orders in graphs. Works by Adler and Adler (Eur. J. Comb.; 2014) and Fabia\'nski et al. (STACS; 2019) prove that in…

We give a combinatorial characterization of the group of quasiconformal homeomorphisms of a closed, oriented surface $S$ of genus at least $2$. In particular, we prove they are exactly the automorphisms of a graph of essential quasicircles…

While the problem of determining whether an embedding of a graph $G$ in $\mathbb{R}^2$ is {\it infinitesimally rigid} is well understood, specifying whether a given embedding of $G$ is {\it rigid} or not is still a hard task that usually…

Recent work on the structure of social networks and the internet has focussed attention on graphs with distributions of vertex degree that are significantly different from the Poisson degree distributions that have been widely studied in…

Let d_i(G) be the density of the 3-vertex i-edge graph in a graph G, i.e., the probability that three random vertices induce a subgraph with i edges. Let S be the set of all quadruples (d_0,d_1,d_2,d_3) that are arbitrary close to 3-vertex…

A well-known application of the dependent random choice asserts that any $n$-vertex graph $G$ with positive edge density contains a `rich' vertex subset $U$ of size $n^{1-o(1)}$ such that every pair of vertices in $U$ has at least…

We revisit the problem of designing sublinear algorithms for estimating the average degree of an $n$-vertex graph. The standard access model for graphs allows for the following queries: sampling a uniform random vertex, the degree of a…

Quantum graph neural networks offer a powerful paradigm for learning on graph-structured data, yet their explainability is complicated by measurement-induced stochasticity and the combinatorial nature of graph structure. In this paper, we…

Chung, Graham, and Wilson proved that a graph is quasirandom if and only if there is a large gap between its first and second largest eigenvalue. Recently, the authors extended this characterization to k-uniform hypergraphs, but only for…

We study the typical structure and the number of triangle-free graphs with $n$ vertices and $m$ edges where $m$ is large enough so that a typical triangle-free graph has a cut containing nearly all of its edges, but may not be bipartite.…

Learning properties of large graphs from samples has been an important problem in statistical network analysis since the early work of Goodman \cite{Goodman1949} and Frank \cite{Frank1978}. We revisit a problem formulated by Frank…

The parameter $q(G)$ of a graph $G$ is the minimum number of distinct eigenvalues over the family of symmetric matrices described by $G$. It is shown that the minimum number of edges necessary for a connected graph $G$ to have $q(G)=2$ is…

The threshold network model is a type of finite random graphs. In this paper, we introduce a generalized threshold network model. A pair of vertices with random weights is connected by an edge when real-valued functions of the pair of…