Related papers: Random graphs, weak coarse embeddings, and higher …
Let $d\geq 3$ be fixed and $G$ be a large random $d$-regular graph on $n$ vertices. We show that if $n$ is large enough then the entry distribution of every almost eigenvector $v$ of $G$ (with entry sum 0 and normalized to have length…
A "folklore conjecture, probably due to Tutte" (as described in [P.D. Seymour, Sums of circuits, Graph theory and related topics (Proc. Conf., Univ. Waterloo, 1977), pp. 341-355, Academic Press, 1979]) asserts that every bridgeless cubic…
We prove that for any finite tree $T$ with $n$ vertices and maximal degree $3$, there is a topological embedding of $T$ into the integer grid $Z^2$ which maps vertices to vertices and whose image meets at most $\frac{7}{3}n$ vertices. This…
Twisted hypercubes are generalizations of the Boolean hypercube, obtained by iteratively connecting two instances of a graph by a uniformly random perfect matching. Dudek et al. showed that when the two instances are independent, these…
This paper is motivated by the following question: what are the unavoidable induced subgraphs of graphs with large treewidth? Aboulker et al. made a conjecture which answers this question in graphs of bounded maximum degree, asserting that…
As a major step in their proof of Wagner's conjecture, Robertson and Seymour showed that every graph not containing a fixed graph $H$ as a minor has a tree-decomposition in which each torso is almost embeddable in a surface of bounded…
Given a `genus' function $g=g(n)$, we let $\mathcal{E}^g$ be the class of all graphs $G$ such that if $G$ has order $n$ (that is, has $n$ vertices) then it is embeddable in a surface of Euler genus at most $g(n)$. Let the random graph $R_n$…
We consider an evolving preferential attachment random graph model where at discrete times a new node is attached to an old node, selected with probability proportional to a superlinear function of its degree. For such schemes, it is known…
The celebrated Erd\H{o}s-Hajnal Conjecture says that in any proper hereditary class of finite graphs we are guaranteed to have a clique or anti-clique of size $n^c$, which is a much better bound than the logarithmic size that is provided by…
Random graphs are more and more used for modeling real world networks such as evolutionary networks of proteins. For this purpose we look at two different models and analyze how properties like connectedness and degree distributions are…
In this article we present theoretical and computational results on the existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs. We also describe an efficient algorithm to compute all polyhedral embeddings of a given…
The random graph model has recently been extended to a random preferential attachment graph model, in order to enable the study of general asymptotic properties in network types that are better represented by the preferential attachment…
We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph is connected, has a perfect fractional matching and,…
In this paper, we introduce a concept of A-by-FCE coarse fibration structure for metric spaces, which serves as a generalization of the A-by-CE structure for a sequence of group extensions proposed by Deng, Wang, and Yu. We prove that the…
We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…
In this paper, we use geometric tools to study the structure of asymptotic expanders and show that a sequence of asymptotic expanders always admits a "uniform exhaustion by expanders". It follows that asymptotic expanders cannot be coarsely…
We consider sequences of large sparse random graphs whose degree distribution approaches a limit with finite mean. This model includes both the random regular graphs and the Erd\"os-Renyi graphs of constant average degree. We prove that the…
We illustrate connections between differential geometry on finite simple graphs G=(V,E) and Riemannian manifolds (M,g). The link is that curvature can be defined integral geometrically as an expectation in a probability space of…
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…
We consider the random hypergraph on a finite vertex set by choosing each set of vertices as an hyperedge independently at random. We express the probability distributions of the (lower-)associated simplicial complex and the…