English
Related papers

Related papers: Two generalisations of Leighton's Theorem

200 papers

We study generalized splines from the perspective of the representation theory of the category of graphs with contractions. Our main theorem proves a kind of finite generation, which in turn implies the existence of a ``universal generating…

Combinatorics · Mathematics 2026-05-26 Jacob Matherne , Eric Ramos , Julianna Tymoczko

This paper develops a harmonic Galois theory for finite graphs, thereby classifying harmonic branched $G$-covers of a fixed base $X$ in terms of homomorphisms from a suitable fundamental group of $X$ together with $G$-inertia structures on…

Combinatorics · Mathematics 2012-12-10 Scott Corry

We use a classical result of McCord and reduction methods of finite spaces to prove a generalization of Thomason's theorem on homotopy colimits over posets. In particular this allows us to characterize the homotopy colimits of diagrams of…

Algebraic Topology · Mathematics 2014-07-23 Ximena Fernandez , Elias Gabriel Minian

When one studies geometric properties of graphs, local finiteness is a common implicit assumption, and that of transitivity a frequent explicit one. By compactness arguments, local finiteness guarantees several regularity properties. It is…

Combinatorics · Mathematics 2017-01-06 Sébastien Martineau

This note presents a new, elementary proof of a generalization of a theorem of Halin to graphs with unbounded degrees, which is then applied to show that every connected, countably infinite graph G with a subdegree-finite, infinite…

Combinatorics · Mathematics 2015-11-16 Wilfried Imrich , Simon M. Smith

We show that every regular graph with good local expansion has a spanning Lipschitz subgraph with large girth and minimum degree. In particular, this gives a finite analogue of the dynamical solution to the von Neumann problem by Gaboriau…

Group Theory · Mathematics 2021-12-06 Gabor Kun

In this article we generalize a theorem of Benson for generalized quadrangles to strongly regular graphs and directed strongly regular graphs. The main result provides numerical restrictions on the number of fixed vertices and the number of…

Combinatorics · Mathematics 2014-11-14 S. De Winter , E. Kamischke , Z. Wang

We prove Levinson's theorem for scattering on an (m+n)-vertex graph with n semi-infinite paths each attached to a different vertex, generalizing a previous result for the case n=1. This theorem counts the number of bound states in terms of…

Mathematical Physics · Physics 2012-11-22 Andrew M. Childs , David Gosset

It is shown that Euler's theorem for graphs can be generalized for 2-complexes. Two notions that generalize cycle and Eulerian tour are introduced (``circlet'' and ``Eulerian cover''), and we show that for a strongly-connected, pure…

Combinatorics · Mathematics 2024-01-02 Richard H. Hammack , Paul C. Kainen

In this article we present a generalization of a Leibniz's geometrical theorem and an application of it.

General Mathematics · Mathematics 2007-10-02 Mihaly Bencze , Florin Popovici , Florentin Smarandache

We give a short proof that every finite graph (or matroid) has a tree-decomposition that displays all maximal tangles. This theorem for graphs is a central result of the graph minors project of Robertson and Seymour and the extension to…

Combinatorics · Mathematics 2016-06-01 Johannes Carmesin

We prove a duality theorem applicable to a a wide range of specialisations, as well as to some generalisations, of tangles in graphs. It generalises the classical tangle duality theorem of Robertson and Seymour, which says that every graph…

Combinatorics · Mathematics 2017-07-07 Reinhard Diestel , Philipp Eberenz , Joshua Erde

The Linearization Theorem for proper Lie groupoids organizes and generalizes several results for classic geometries. Despite the various approaches and recent works on the subject, the problem of understanding invariant linearization…

Differential Geometry · Mathematics 2021-08-20 Matias del Hoyo , Mateus de Melo

There are different definitions of ends in non-locally-finite graphs which are all equivalent in the locally finite case. We prove the compactness of the end-topology that is based on the principle of removing finite sets of vertices and…

Combinatorics · Mathematics 2009-10-31 B. Krön

For any configuration of pebbles on the nodes of a graph, a pebbling move replaces two pebbles on one node by one pebble on an adjacent node. A cover pebbling is a move sequence ending with no empty nodes. The number of pebbles needed for a…

Combinatorics · Mathematics 2007-05-23 Jonas Sjostrand

We prove some results concerning Alcuin number of graphs. First, we classify graphs which have unique minimum vertex cover. Then we present two necessary conditions for a graph to be of class two and show why one of them (condition on…

Combinatorics · Mathematics 2014-09-25 Abbas Seify , Hossein Shahmohamad

We give elementary proofs of the following two theorems on automorphisms of a finite group G: (1) An automorphism of G is inner if and only if it extends to an automorphism of every finite group containing G. (2) There exists a finite…

Group Theory · Mathematics 2024-05-07 Benjamin Sambale

The authors have used generalised Galois Theory to construct a homotopy double groupoid of a surjective fibration of Kan simplicial sets. Here we apply this to construct a new homotopy double groupoid of a map of spaces, which includes…

Algebraic Topology · Mathematics 2007-05-23 R. Brown , G. Janelidze

It is well-known that a complete Riemannian manifold M which is locally isometric to a symmetric space is covered by a symmetric space. Here we prove that a discrete version of this property (called local to global rigidity) holds for a…

Metric Geometry · Mathematics 2019-11-26 Mikael de la Salle , Romain Tessera

The paper deals with a comprehensive theory of mappings, whose local behavior can be described by means of linear subspaces, contained in the graphs of two (primal and dual) generalized derivatives. This class of mappings includes the…

Optimization and Control · Mathematics 2021-12-08 Helmut Gfrerer , Jiri V. Outrata