Related papers: A counter-example to Baranyai's combinatorial char…
Measure contraction property is one of the possible generalizations of Ricci curvature bound to more general metric measure spaces. In this paper, we discover sufficient conditions for a three dimensional contact subriemannian manifold to…
A rigidity theory is developed for bar-joint frameworks in $\mathbb{R}^{d+1}$ whose vertices are constrained to lie on concentric $d$-spheres with independently variable radii. In particular, combinatorial characterisations are established…
Topological indices are important bridge between graph theory and chemical applications. The study of graph matching expandability has been an influential topic in recent research on graph structure. In this paper, we provide some…
This note gives necessary and sufficient conditions for a sequence of non-negative integers to be the degree sequence of a connected simple graph. This result is implicit in a paper of Hakimi. A new alternative characterisation of these…
In recent years, network models have become more complex with the development of big data. Therefore, more advanced network analysis is required. In this paper, we introduce a new quantitative measure named combinatorial evaluation, which…
Consider a host hypergraph $G$ which contains a spanning structure due to minimum degree considerations. We collect three results proving that if the edges of $G$ are sampled at the appropriate rate then the spanning structure still appears…
We consider polynomial approximations of z-bar to better understand the torsional rigidity of polygons. Our main focus is on low degree approximations and associated extremal problems that are analogous to Polya's conjecture for torsional…
We study the rigidity of body-and-cad frameworks which capture the majority of the geometric constraints used in 3D mechanical engineering CAD software. We present a combinatorial characterization of the generic minimal rigidity of a subset…
Graph comparison is a certain type of condition on metric space encoded by a finite graph. We show that any nontrivial graph comparison implies one of Alexandrov's comparisons. The proof gives a complete description of graphs with trivial…
We introduce the graph theoretical parameter of edge treewidth. This parameter occurs in a natural way as the tree-like analogue of cutwidth or, alternatively, as an edge-analogue of treewidth. We study the combinatorial properties of…
In this paper, we give explicit combinatorial descriptions for toric extremal contractions under the relative setting, where varieties do not need to be complete. Fujino's completion theorem is the key to the main result. As applications,…
A graph is regularizable if it is possible to assign weights to its edges so that all nodes have the same degree. Weights can be positive, nonnegative or arbitrary as soon as the regularization degree is not null. Positive and nonnegative…
We calculate the intersection ring of three-dimensional graph manifolds with rational coefficients and give an algebraic characterization of these rings when the manifold's underlying graph is a tree. We are able to use this…
A typical result in graph theory says that a graph $G$, satisfying certain conditions, has some property $\cal P$. Once such a theorem is established, it is natural to ask how strongly $G$ satisfies $\cal P$. Can one strengthen the result…
We show that minimally 3-rigid block-and-hole graphs, with one block or one hole, are characterised as those which are constructible from $K_3$ by vertex splitting, and also, as those having associated looped face graphs which are…
We provide a direct combinatorial proof of a Feynman graph identity which implies a wide generalization of a formality theorem by Kontsevich. For a Feynman graph $\Gamma$, we associate to each vertex a position $x_v \in \mathbb R$ and to…
We prove that the theory of the Farey graph is pseudofinite by constructing a sequence of finite structures that satisfy increasingly large subsets of its first-order axiomatization. This graph is an important object in the study of curve…
In this article, we study the possibility of producing a Calabi-Yau threefold in positive characteristic which is a counter-example to Kodaira vanishing. The only known method to construct the counter-example is so called inductive method…
We study the $p$-\emph{torsion function} and the corresponding $p$-\emph{torsional rigidity} associated with $p$-Laplacians and, more generally, $p$-Schr\"odinger operators, for $1<p<\infty$, on possibly infinite combinatorial graphs. We…
We suggest a way to associate to a rational map of the Riemann sphere a three dimensional object called a hyperbolic orbifold 3-lamination. The relation of this object to the map is analogous to the relation of a hyperbolic 3-manifold to a…