Related papers: On a small cancellation theorem of Gromov
The comparison map from bounded cohomology to singular cohomology plays an important role in the study of bounded cohomology theory and its applications. The vanishing and covering theorems of Gromov and Ivanov show interesting and useful…
We give an elementary proof of an interesting combinatorial identity which is of particular interest in graph theory and its applications. Two applications to enumeration of forests with closed-form expressions are given.
This short note shows how the Novikov conjecture for mapping class groups follows from a theorem of Kato and a result theorem of Hamenstadt.
The paper deals with some spectral properties of (mostly infinite) quantum and combinatorial graphs. Quantum graphs have been intensively studied lately due to their numerous applications to mesoscopic physics, nanotechnology, optics, and…
We start by building up some theory to state Wagner's Theorem, and then prove it using Kuratowski's Theorem, a proof of which is found in Diester (2000). Following this, we establish some connections between the chromatic number of a graph…
We introduce and study categorical realizations of quivers. This construction generalizes comma categories and includes representations of quivers on categories, twisted representations of quivers and bilinear pairings as special cases. We…
We give an especially simple proof of a theorem in graph theory that forms the key part of the solution to a problem in commutative algebra, on how to characterize the integral closure of a polynomial ring generated by quadratic monomials.
In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This…
In this paper, we explore some interesting applications of the matrix tree theorem. In particular, we present a combinatorial interpretation of a distribution of $(n-1)^{n-1}$, in the context of uprooted spanning trees of the complete graph…
We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of…
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…
We give a new characterisation of virtually free groups using graph minors. Namely, we prove that a finitely generated, infinite group is virtually free if and only if for any finite generating set, the corresponding Cayley graph is minor…
Twisted Wirtinger presentations are generalizations of the classical Wirtinger presentations of knot and link groups. In this paper, we prove that if a finitely generated group admitting a twisted Wirtinger presentation is Gromov…
The smallness is proved of fundamental groups for arithmetic schemes. This is a higher dimensional analogue of the Hermite-Minkowski theorem. We also refer to the case of varieties over finite fields. As an application, we prove certain…
Carrier graphs of groups representing subgroups of a given relatively hyperbolic groups are introduced and a combination theorem for relatively quasi-convex subgroups is proven. Subsequently a theory of folds for such carrier graphs is…
In this note we give a short proof that graphs having no linearly small F{\o}lner sets can be partitioned into a union of expanders. We use this fact to prove a partition result for graphs admitting linearly small maximal F{\o}lner sets and…
In this short review we introduce group field theory, a particular class of random tensor models, which represents nowadays one of the candidates for a fundamental theory of quantum gravity. We insist on the combinatorial richness of…
We present a combinatorial analogue of the nerve theorem for covers of small categories, using the Grothendieck construction. We apply our result to prove the inclusion-exclusion principle for the Euler characteristic of a finite category.
The KAM theorem from a combinatorial viewpoint.
Recently we have obtained two simple proofs of Sharkovsky's theorem, one with directed graphs [7] and the other without [8]. In this note, we present yet more simple proofs of Sharkovsky's theorem.