Related papers: Tranched graphs: consequences for topology and dyn…
We study Gibbs distributions of spins taking values in a general compact Polish space, interacting via a pair potential along the edges of a generalized random graph with a given asymptotic weight distribution $P$, obtained by annealing…
Wheeler emphasized the study of Superspace - the space of 3-geometries on a spatial manifold of fixed topology. This is a configuration space for GR; knowledge of configuration spaces is useful as regards dynamics and QM.In this Article I…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…
We introduce probability-graphons which are probability kernels that generalize graphons to the case of weighted graphs. Probability-graphons appear as the limit objects to study sequences of large weighted graphs whose distribution of…
It is a well-known fact in K-theory that the rapidly decreasing matrices of countable size form an associative topological algebra whose set of quasi-invertible elements is open, and such that the quasi-inversion map is continuous. We…
Comparability graphs are a popular class of graphs. We introduce as the digraph analogue of comparability graphs the class of comparability digraphs. We show that many concepts such as implication classes and the knotting graph for a…
We study Minkowski supersymmetric flux vacua of type II string theory. Based on the work by M. Grana, R. Minasian, M. Petrini and A. Tomasiello, we briefly explain how to reformulate things in terms of Generalized Complex Geometry, which…
In this survey we overview known results and get several new results on digraph compositions which generalize several classes of digraphs, such as quasi-transitive digraphs. After an introductory section, the paper is divided into six…
We introduce, for every surface {\Sigma}, a two-way connection between FO transductions (first-order logical transformations) of the graphs embeddable in {\Sigma} and a certain variant of fan-crossing drawings of graphs in {\Sigma}. If the…
We show that every complete $n$-vertex simple topological graph contains a topological subgraph on at least $(\log n)^{1/4 - o(1)}$ vertices that is weakly isomorphic to the complete convex geometric graph or the complete twisted graph.…
We say that a digraph is essentially cyclic if its Laplacian spectrum is not completely real. The essential cyclicity implies the presence of directed cycles, but not vice versa. The problem of characterizing essential cyclicity in terms of…
The class of normal subshifts includes irreducible infinite topological Markov shifts, irreducible infinite sofic shifts, synchronized systems, Dyck shifts, $\beta$-shifts, substitution minimal shifts, and so on. We will characterize…
A thrackle is a drawing of a graph in which each pair of edges meets precisely once. Conway's Thrackle Conjecture asserts that a planar thrackle drawing of a graph cannot have more edges than vertices, which is equivalent to saying that no…
We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that…
Despite remarkable success in describing supergravity reductions and backgrounds, generalized geometry and the closely related exceptional field theory are still lacking a fundamental object of differential geometry, the Riemann tensor. We…
In `A survey of two-graphs' \cite{Sei}, J.J. Seidel lays out the connections between simple graphs, two-graphs, equiangular lines and strongly regular graph. It is well known that there is a one-to-one correspondence between regular…
Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…
We provide a unified description of Heinz-type mean curvature estimates under an assumption on the gradient bound for space-like graphs and time-like graphs in the Lorentz-Minkowski space. As a corollary, we give a unified vanishing theorem…
We expand the structural theory of \ca graphs that avoid specific cyclic coset patterns. We present several characterisations of tree-likeness for these structures and show a close connection to $\alpha$-acyclic hypergraphs. A focus lies on…
Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with respect to some local forbidden crossing configurations.…