Related papers: On convergence for graphexes
We study the relationship between different kinds of convergence of finite signed measures and discuss their metrizability. In particular, we study the concept of basic convergence recently introduced by Khartov [arXiv:2204.13667] and…
We consider two possible extensions of a theorem of Thomassen characterizing the graphs admitting a 2-vertex-connected orientation. First, we show that the problem of deciding whether a mixed graph has a 2-vertex-connected orientation is…
Recently, Beresnevich, Vaughan, Velani, and Zorin (arXiv: 1506.09049) gave some sufficient conditions for a manifold to be of Khinchin type for convergence. We show that their techniques can be used in a more optimal way to yield stronger…
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…
A well-known conjecture of Gr\"unbaum and Nash-Williams proposes that 4-connected toroidal graphs are hamiltonian. The corresponding results for 4-connected planar and projective-planar graphs were proved by Tutte and by Thomas and Yu,…
We study a modified notion of Ollivier's coarse Ricci curvature on graphs introduced by Lin, Lu, and Yau in [11]. We establish a rigidity theorem for complete graphs that shows a connected finite simple graph is complete if and only if the…
There is much recent interest in understanding the density at which constant size graphs can appear in a very large graph. Specifically, the inducibility of a graph H is its extremal density, as an induced subgraph of G, where |G| ->…
The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consistent if every circle (cycle, circuit) has positive vertex-sign product. Acharya, Acharya, and Sinha recently characterized line-consistent…
Immersions of graphs to the projective plane are studied. A classification of immersions up to regular homotopy is given. A complete invariant of immersions up to regular homotopy is constructed. Equivalence classes are described.
We study in this paper three natural notions of convergence of homogeneous manifolds, namely infinitesimal, local and pointed, and their relationship with a fourth one, which only takes into account the underlying algebraic structure of the…
An $n$-vertex graph $G$ of edge density $p$ is considered to be quasirandom if it shares several important properties with the random graph $G(n,p)$. A well-known theorem of Chung, Graham and Wilson states that many such `typical'…
We discuss various phenomena of tangency in projective and convex geometry.
The relative Cayley graph of a group $G$ with respect to its proper subgroup $H$, is a graph whose vertices are elements of $G$ and two vertices $h\in H$ and $g\in G$ are adjacent if $g=hc$ for some $c\in C$, where $C$ is an inversed-closed…
This is a survey of some of the consequences of the recently introduced congruences on the theory of connectednesses (radical classes) and disconnectednesses (semisimple classes) of graphs and topological spaces. In particular, it is shown…
In this short note, we extend the linear convergence result of the Cauchy algorithm, derived recently by E. Klerk, F. Glineur, and A. Taylor, from the case of smooth strongly convex functions to the case of restricted strongly convex…
In the standard Category of Graphs, the graphs allow only one edge to be incident to any two vertices, not necessarily distinct, and the graph morphisms must map edges to edges and vertices to vertices while preserving incidence. We refer…
A geometric framework relating valuations on convex bodies to valuations on convex functions is introduced. It is shown that a classical result by McMullen can be used to obtain a characterization of continuous, epi-translation invariant,…
Feller, Klug, Schirmer and Zemke showed the homology and the intersection form of a closed trisected 4-manifold are described in terms of trisection diagram. In this paper, it is confirmed that we are able to calculate those of a trisected…
In this paper we introduce a new notion of convergence of sparse graphs which we call Large Deviations or LD-convergence and which is based on the theory of large deviations. The notion is introduced by "decorating" the nodes of the graph…
A graph is an opposition graph, respectively, a coalition graph, if it admits an acyclic orientation which puts the two end-edges of every chordless 4-vertex path in opposition, respectively, in the same direction. Opposition and coalition…