Related papers: Weak randomness in graphons and theons
We study the relation between the growth rate of a graph property and the entropy of the graph limits that arise from graphs with that property. In particular, for hereditary classes we obtain a new description of the colouring number,…
We give characterizations for the failure of form uniqueness on weakly spherically symmetric graphs. The first characterization is in terms of the graph structure, the second involves the capacity of a Cauchy boundary. We also discuss the…
The term "strong approximation" is used to describe phenomena where an arithmetic group as well as all of its Zariski dense subgroups have a large image in the congruence quotients. We exhibit analogues of such phenomena in a probabilistic,…
One of the major results of [N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B, 63(1):65--110, 1995], also known as the weak structure theorem, revealed the local structure of graphs…
A group $G$ given by a presentation $G = < \mathcal A \| \mathcal R >$ is called weakly finitely presented if every finitely generated subgroup of $G$, generated by (images of) some words in $\mathcal A^{\pm 1}$, is naturally isomorphic to…
Let $F$ and $G$ be two graphs. A spanning subgraph $H$ of $G$ is called weakly $F$-saturated if one can add to $H$ the edges of $G \setminus H$ in some order, so that whenever a new edge is added, a new copy of $F$ is formed. Obtaining…
A graph with a trivial automorphism group is said to be rigid. Wright proved that for $\frac{\log n}{n}+\omega(\frac 1n)\leq p\leq \frac 12$ a random graph $G\in G(n,p)$ is rigid whp. It is not hard to see that this lower bound is sharp and…
We introduce weak oddness $\omega_{\textrm w}$, a new measure of uncolourability of cubic graphs, defined as the least number of odd components in an even factor. For every bridgeless cubic graph $G$, $\rho(G)\le\omega_{\textrm…
We introduce the weak Haagerup property for locally compact groups and prove several hereditary results for the class of groups with this approximation property. The class contains a priori all weakly amenable groups and groups with the…
In this short note we provide a relatively simple proof of the Erd\H{o}s-Hajnal conjecture for families of finite (hyper-)graphs without the $k$-order property. It was originally proved by M. Malliaris and S. Shelah in "Regularity lemmas…
A graph property (i.e., a set of graphs) is induced-hereditary or additive if it is closed under taking induced-subgraphs or disjoint unions. If $\cP$ and $\cQ$ are properties, the product $\cP \circ \cQ$ consists of all graphs $G$ for…
We say that a graph $H$ dominates another graph $H'$ if the number of homomorphisms from $H'$ to any graph $G$ is dominated, in an appropriate sense, by the number of homomorphisms from $H$ to $G$. We study the family of dominating graphs,…
The Graph Reconstruction Conjecture famously posits that any undirected graph on at least three vertices is determined up to isomorphism by its family of (unlabeled) induced subgraphs. At present, the conjecture admits partial resolutions…
A weakly distance-regular digraph is thick if its attached scheme is regular. In this paper, we show that each commutative thick weakly distance-regular digraph has a thick weakly distance-regular subdigraph such that the corresponding…
In this note, we show how to obtain a "characteristic power series" of graphons -- infinite limits of dense graphs -- as the limit of normalized reciprocal characteristic polynomials. This leads to a new characterization of graph…
A graphon satisfies the $H$-property if graphs sampled from it contain a Hamiltonian decomposition almost surely, which in turn implies that the corresponding network topologies are, e.g., structurally stable and structurally ensemble…
Given a finite set $X$ of points in $R^n$ and a family $F$ of sets generated by the pairs of points of $X$, we determine volumetric and structural conditions for the sets that allow us to guarantee the existence of a positive-fraction…
For self-similar sets, there are two important separation properties: the open set condition and the weak separation condition introduced by Zerner, which may be replaced by the formally stronger finite type property of Ngai and Wang. We…
We prove that a saturated weakly branch group $G$ has the property $R_\infty$ (any automorphism $\phi:G\to G$ has infinite Reidemeister number) in each of the following cases: 1) any element of $Out(G)$ has finite order; 2) for any $\phi$…
Closed graphs have been characterized by Herzog et al. as the graphs whose binomial edge ideals have a quadratic Gr\"obner basis with respect to a diagonal term order. In this paper, we focus on a generalization of closed graphs, namely…