相关论文: Counting cycles in labeled graphs: The nonpositive…

Previously, the authors proved that the presentation complex of a one-relator group $G$ satisfies a geometric condition called negative immersions if every two-generator, one-relator subgroup of $G$ is free. Here, we prove that one-relator…

We prove that one-relator groups are coherent, solving a well-known problem of Gilbert Baumslag. Our proof strategy is readily applicable to many classes of groups of cohomological dimension two. We show that fundamental groups of…

We prove a freeness theorem for low-rank subgroups of one-relator groups. Let $F$ be a free group, and let $w\in F$ be a non-primitive element. The primitivity rank of $w$, $\pi(w)$, is the smallest rank of a subgroup of $F$ containing $w$…

We prove that the $2$-complex associated to the presentation $\langle a,b \mid b,bab^{-1}a^{-2}\rangle$ has contracting non-positive immersions and positive maximal irreducible curvature. This example shows that the contracting non-positive…

We prove Wise's $W$-cycles conjecture. Consider a compact graph $\Gamma'$ immering into another graph $\Gamma$. For any immersed cycle $\Lambda:S^1\to \Gamma$, we consider the map $\Lambda'$ from the circular components $\mathbb{S}$ of the…

A few steps are made towards representation theory of embeddability among uncountable graphs. A monotone class of graphs is defined by forbidding countable subgraphs, related to the graph's end-structure. Using a combinatorial theorem of…

We fully disprove a conjecture of Haythorpe on the minimum number of hamiltonian cycles in regular hamiltonian graphs, thereby extending a result of Zamfirescu, as well as correct and complement Haythorpe's computational enumerative results…

We prove the Strengthened Hanna Neumann Conjecture, in its common graph theoretic formulation. Our original approach to this conjecture used cohomology of sheaves on graphs, although here we give a short combinatorial proof that we found in…

The analogue of Hadwiger's conjecture for the immersion relation states that every graph $G$ contains an immersion of $K_{\chi(G)}$. For graphs with independence number 2, this is equivalent to stating that every such $n$-vertex graph…

We prove a refinement of the flat wall theorem of Robertson and Seymour to undirected group-labelled graphs $(G,\gamma)$ where $\gamma$ assigns to each edge of an undirected graph $G$ an element of an abelian group $\Gamma$. As a…

We recall several known results about minimally 2-connected graphs, and show that they all follow from a decomposition theorem. Starting from an analogy with critically 2-connected graphs, we give structural characterizations of the classes…

We prove a few results about non-nilpotent graphs of symmetric groups $S_n$ -- namely that they have a Hamiltonian cycle and they satisfy a conjecture of Nongsiang and Saikia. The latter is likewise proven for alternating groups $A_n$. We…

A 2-complex $K$ has collapsing non-positive immersion if for every combinatorial immersion $X\to K$, where $X$ is finite, connected and does not allow collapses, either $\chi(X)\le 0$ or $X$ is point. This concept is due to Wise who also…

An integral homology theory on the category of undirected reflexive graphs was constructed in [2]. A geometrical method to understand behaviors of $1$- and $2$-simplices under differential maps of the theory was developed in [3] and led us…

We prove that one-relator groups with negative immersions are hyperbolic and virtually special; this resolves a recent conjecture of Louder and Wilton. As a consequence, one-relator groups with negative immersions are residually finite,…

Hadwiger's conjecture for the immersion relation posits that every graph $G$ contains an immersion of the complete graph $K_{\chi(G)}$. Vergara showed that this is equivalent to saying that every $n$-vertex graph $G$ with $\alpha(G)=2$…

It is shown that a graph parameter can be realized as the number of homomorphisms into a fixed (weighted) graph if and only if it satisfies two linear algebraic conditions: reflection positivity and exponential rank-connectivity. In terms…

We prove a decomposition theorem for graphs that do not contain a subdivision of $K_4$ as an induced subgraph where $K_4$ is the complete graph on four vertices. We obtain also a structure theorem for the class $\cal C$ of graphs that…

In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…

We prove that every separable tracial von Neumann algebra embeds into a II$_1$ factor with property (T) which can be taken to have trivial outer automorphism and fundamental groups. We also establish an analogous result for the trivial…