Related papers: Random Schreier graphs and expanders

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

We show that almost surely the rank of the adjacency matrix of the Erd\"os-R\'enyi random graph $G(n,p)$ equals the number of non-isolated vertices for any $c\ln n/n<p<1/2$, where $c$ is an arbitrary positive constant larger than 1/2. In…

Let $G$ be a uniformly chosen simple (labelled) random graph with given degree sequence $\boldsymbol{d}$ and let $X,Y,L$ be edge-disjoint graphs on the same vertex set as $G$. We investigate the probability that $X \subseteq G$ and that $G…

Let $R$ be a commutative ring and let $U(R)$ be multiplicative group of unit elements of $R$. In 2012, Khashyarmanesh et al. defined generalized unit and unitary Cayley graph, $\Gamma(R, G, S)$, corresponding to a multiplicative subgroup…

We prove that asymptotically almost surely, the random Cayley sum graph over a finite abelian group $G$ has edge density close to the expected one on every induced subgraph of size at least $\log^c |G|$, for any fixed $c > 1$ and $|G|$…

The {\em disjointness graph} $G=G({\cal S})$ of a set of segments ${\cal S}$ in $R^d$, $d\ge 2,$ is a graph whose vertex set is ${\cal S}$ and two vertices are connected by an edge if and only if the corresponding segments are disjoint. We…

We give a geometric approach to groups defined by automata via the notion of enriched dual of an inverse transducer. Using this geometric correspondence we first provide some finiteness results, then we consider groups generated by the dual…

We study the number of $k$-element sets $A \subset \{1,\ldots,N\}$ with $|A + A| \leq K|A|$ for some (fixed) $K > 0$. Improving results of the first author and of Alon, Balogh, Samotij and the second author, we determine this number up to a…

Let $D$ be a connected oriented graph. A set $S \subseteq V(D)$ is convex in $D$ if, for every pair of vertices $x, y \in S$, the vertex set of every $xy$-geodesic, ($xy$ shortest directed path) and every $yx$-geodesic in $D$ is contained…

A classical result of Koml\'os, S\'ark\"ozy and Szemer\'edi states that every $n$-vertex graph with minimum degree at least $(1/2+ o(1))n$ contains every $n$-vertex tree with maximum degree $O(n/\log{n})$ as a subgraph, and the bounds on…

We prove that the random ordered graph is a semi-retract of the canonically ordered atomless Boolean algebra, hereby answering an open question of Barto\v{s}ov\'a and Scow.

A graph $\Gamma$ labelled by a set $S$ defines a group $G(\Gamma)$ whose generators are the set of labels $S$ and whose relations are all words which can be read on closed paths of this graph. We introduce the notion of aspherical graph and…

We consider discrete Schr\"odinger operators with real periodic potentials on periodic graphs. The spectra of the operators consist of a finite number of bands. By "rolling up" a periodic graph along some appropriate directions we obtain…

For a graph $G=(V,E)$, let $bc(G)$ denote the minimum number of pairwise edge disjoint complete bipartite subgraphs of $G$ so that each edge of $G$ belongs to exactly one of them. It is easy to see that for every graph $G$, $bc(G) \leq n…

Let $G$ be a finite group acting transitively on a set $\Omega$. We study what it means for this action to be {\it quasirandom}, thereby generalizing Gowers' study of quasirandomness in groups. We connect this notion of quasirandomness to…

We prove that random d-regular Cayley graphs of the symmetric group asymptotically almost surely have girth at least (log_{d-1}|G|)^{1/2}/2 and that random d-regular Cayley graphs of simple algebraic groups over F_q asymptotically almost…

We construct explicit generating sets S_n and \tilde S_n of the for the alternating and the symmetric groups, which turn the Cayley graphs C(Alt(n), S_n) and C(Sym(n), \tilde S_n) into a family of bounded degree expanders for all n. This…

In \cite{reed97}, Reed conjectures that the inequality $\chi (G) \leq \left \lceil \textstyle {1/2} (\omega (G) + \Delta (G) + 1) \right \rceil$ holds for any graph $G$. We prove this holds for a graph $G$ if $\bar{G}$ is disconnected. From…

A $biased\ graph$ is a pair $(G,\mathcal{B})$, where $G$ is a graph and $\mathcal{B}$ is a collection of `balanced' circuits of $G$ such that no $\Theta$-subgraph of $G$ contains precisely two balanced circuits. We prove a Ramsey-type…

We construct an infinite family of triples (G,S1, S2) each consisting of a group G and a pair (S1, S2) of distinct subsets of G with the following properties. i The two Cayley graphs Cay(G, S1) and Cay(G,S2) are non-isomorphic. ii The…