Related papers: Fixing the Kawarabayashi-Thomas-Wollan Flat Wall
In this article we define a minor relation, which is stronger than the classical one, but too strong to become a well-quasi-order on the class of finite graphs. Nevertheless, with this terminology we are able to introduce a conjecture,…
Inspired by asymptotically flat manifolds, we introduce the concept of asymptotically flat graphs and define the discrete ADM mass on them. We formulate the discrete positive mass conjecture based on the scalar curvature in the sense of…
In an early work from 1896, Maschke established the complete list of all finite planar Cayley graphs. This result initiated a long line of research over the next century, aiming at characterizing in a similar way all planar infinite Cayley…
We establish Flat Torus Theorem type results for groups acting on small cancellation complexes satisfying C(6), C(4)-T(4) and C(3)-T(6) conditions. For C(3)-T(6) complexes the result closely parallels the CAT(0) setting. For C(6) complexes…
The rigidity of the positive mass theorem states that the only complete asymptotically flat manifold of nonnegative scalar curvature and zero mass is Euclidean space. We prove a corresponding stability theorem for spaces that can be…
In this paper, we present a phenomenological picture based on the composite fermion theory, in responding to the recent discovery by Shahar et al. of a new transport regime near the transition from a $\nu=1$ quantum Hall liquid to a Hall…
Our work builds on known results for k-uniform hypergraphs including the existence of limits, a Regularity Lemma and a Removal Lemma. Our main tool here is a theory of measures on ultraproduct spaces which establishes a correspondence…
Studying the shortness of longest cycles in maximal planar graphs, we improve the upper bound on the shortness exponent of the class of $\frac{5}{4}$-tough maximal planar graphs presented by Harant and Owens [Discrete Math. 147 (1995),…
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,…
Almost forty years ago, C.T.C. Wall systematically analyzed the set of "thickenings" of a finite CW complex. Of the results he obtained, probably the most computationally important is the "suspension theorem," which is an exact sequence…
We discuss several counterexamples to a rigidity conjecture of K. Khanin, which states that under some quantitative condition on non-existence of periodic orbits, $C^0$ conjugacy implies $C^1$ (even $C^\infty$) conjugacy. We construct…
In paper I of this series on fluid turbulence we showed that exact resummations of the perturbative theory of the structure functions of velocity differences result in a finite (order by order) theory. These findings exclude any known…
This text is devoted to the systematic study of relative properties in the context of Berkovich analytic spaces. We first develop a theory of flatness in this setting. After having shown through a counter-example that naive flatness cannot…
Convergence of projection-based methods for nonconvex set feasibility problems has been established for sets with ever weaker regularity assumptions. What has not kept pace with these developments is analogous results for convergence of…
The concept of matrix rigidity was first introduced by Valiant in 1977. Roughly speaking, a matrix is rigid if its rank cannot be reduced significantly by changing a small number of entries. There has been extensive interest in rigid…
We introduce weak oddness $\omega_{\textrm w}$, a new measure of uncolourability of cubic graphs, defined as the least number of odd components in an even factor. For every bridgeless cubic graph $G$, $\rho(G)\le\omega_{\textrm…
We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular…
This is the third in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. In this…
Inspired by the Finn-Osserman (1964), Chern (1969), do Carmo-Peng (1979) proofs of the Bernstein theorem, which characterizes flat planes as the only entire minimal graphs, we prove a new rigidity theorem for associate families connecting…
A criterion is established for the transitivity of connectedness in a transfinite graph. Its proof is much shorter than a prior argument published previously for that criterion.