Related papers: Bottlenecking in graphs and a coarse Menger-type t…
We study a type of calculus for proving inequalities between subgraph densities which is based on Jensen's inequality for the logarithmic function. As a demonstration of the method we verify the conjecture of Erd\"os-Simonovits and…
The product version of the 1-2-3 Conjecture, introduced by Skowronek-Kazi{\'o}w in 2012, states that, a few obvious exceptions apart, all graphs can be 3-edge-labelled so that no two adjacent vertices get incident to the same product of…
Estimating the probability that the Erd\H{o}s-R\'enyi random graph $G(n,m)$ is $H$-free, for a fixed graph $H$, is one of the fundamental problems in random graph theory. If $m$ is such that each edge of $G(n,m)$ belongs to a copy of $H'$…
Karo\'nski, {\L}uczak and Thomason conjectured in 2004 that for every finite graph without isolated edge, the edges can be assigned weights from $\{1,2,3\}$ in such a way that the endvertices of each edge have different sums of incident…
This is an investigation of the role of shuffling and concatenating in the theory of graph drawing. A simple syntactic description of these and related operations is proved complete in the context of finite partial orders, as general as…
In the finite projective space PG$(2n,q)$ we consider flags of type $(n-1,n)$, that is, pairs $(A,B)$ consisting of an $(n-1)$-space $A$ and an $n$-space $B$ that are incident. Two such flags $(A_1,B_1)$ and $(A_2,B_2)$ are opposite if…
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…
Menger conjectured that subsets of $\mathbb R$ with the Menger property must be $\sigma$-compact. While this is false when there is no restriction on the subsets of $\mathbb R$, for projective subsets it is known to follow from the Axiom of…
This paper studies higher index theory for a random sequence of bounded degree, finite graphs with diameter tending to infinity. We show that in a natural model for such random sequences the following hold almost surely: the coarse…
Asymptotic properties of random graph sequences, like occurrence of a giant component or full connectivity in Erd\H{o}s-R\'enyi graphs, are usually derived with very specific choices for defining parameters. The question arises to which…
This is a companion note to our paper 'Some advances on Sidorenko's conjecture', elaborating on a remark in that paper that the approach which proves Sidorenko's conjecture for strongly tree-decomposable graphs may be extended to a broader…
In this paper, we prove a theorem on tight paths in convex geometric hypergraphs, which is asymptotically sharp in infinitely many cases. Our geometric theorem is a common generalization of early results of Hopf and Pannwitz [12],…
In a recent work, Keusch proved the so-called 1-2-3 Conjecture, raised by Karo\'nski, {\L}uczak, and Thomason in 2004: for every connected graph different from $K_2$, we can assign labels~$1,2,3$ to the edges so that no two adjacent…
In this work, which was inspired by the article [2] by M. V. Velasco and A. R. Villena, we obtain a characterization for probably continuous operators and show that the probability of a linear random operator being continuous coincides with…
A known failing of many popular random graph models is that the Aldous-Hoover Theorem guarantees these graphs are dense with probability one; that is, the number of edges grows quadratically with the number of nodes. This behavior is…
The presence of hierarchy in many real-world networks is not yet fully explained. Complex interaction networks are often coarse-grain models of vast modular networks, where tightly connected subgraphs are agglomerated into nodes for…
Concentration results say that a sequence of random variables becomes progressively concentrated around the mean. Such results are common in the study of functions of random graphs. We introduce a real-valued logic with various aggregate…
In this paper, we investigate Liu-Xu-Ye-Zhao's conjecture [30] and prove a sharp convergence theorem for the mean curvature flow of arbitrary codimension in spheres which improves the convergence theorem of Baker [2] as well as the…
We show that for a sequence of random graphs Brouwer's conjecture holds true with probability tending to one as the number of vertices tends to infinity. Surprisingly, it was found that a similar statement holds true for weighted graphs…
In \cite{Mil}, Milnor posed the {\em Monotonicity Conjecture} that the set of parameters within a family of real multimodal polynomial interval maps, for which the topological entropy is constant, is connected. This conjecture was proved…