English
Related papers

Related papers: Leighton's Theorem: extensions, limitations, and q…

200 papers

We classify the finite quasisimple groups whose commuting graph is perfect and we give a general structure theorem for finite groups whose commuting graph is perfect.

Group Theory · Mathematics 2015-10-26 John R. Britnell , Nick Gill

We show that if a graph admits a packing and a covering both consisting of $\lambda$ many spanning trees, where $\lambda$ is some infinite cardinal, then the graph also admits a decomposition into $\lambda$ many spanning trees. For finite…

Combinatorics · Mathematics 2024-05-27 Joshua Erde , Pascal Gollin , Atilla Joó , Paul Knappe , Max Pitz

We construct the lattice gauge theory of the group G_N, the semidirect product of the permutation group S_N with U(1)^N, on an arbitrary Riemann surface. This theory describes the branched coverings of a two-dimensional target surface by…

High Energy Physics - Theory · Physics 2009-11-07 M. Billo' , A. D'Adda , P. Provero

The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph $G$ is equivalent to…

Combinatorics · Mathematics 2014-09-25 Daniel J. Harvey , David R. Wood

We give a group theoretic characterization of geodesics with superlinear divergence in the Cayley graph of a right-angled Artin group A(G) with connected defining graph G. We use this to determine when two points in an asymptotic cone of…

Group Theory · Mathematics 2010-01-26 Jason Behrstock , Ruth Charney

We prove that if $ T $ is a semi-special tree that is not special, then there exists a graph $ G $, formed as an inflation of a sparse $ T $-graph, such that for any special tree $ S $, $ G $ is not a subdivision of an inflation of an…

Logic · Mathematics 2024-11-11 Leandro Aurichi , Gabriel Fernandes , Paulo Magalhães Júnior

Carmesin has extended Robertson and Seymour's tree-of-tangles theorem to the infinite tangles of locally finite infinite graphs. We extend it further to the infinite tangles of all infinite graphs. Our result has a number of applications…

Combinatorics · Mathematics 2021-01-20 Ann-Kathrin Elm , Jan Kurkofka

We show that P2T - the problem of deciding whether the edge set of a simple graph can be partitioned into two trees or not - is NP-complete.

Computational Complexity · Computer Science 2010-02-23 Domotor Palvolgyi

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…

Combinatorics · Mathematics 2025-08-01 Ugo Giocanti

Mubayi and Verstraete conjectured that if $T$ is a tree on $t + 1$ vertices, then any $n$-vertex graph $G$ with average degree $d$ contains at least \[ n d(d - 1) \cdots (d - t + 1) \] labeled copies of $T$ as long as $d$ is sufficiently…

Combinatorics · Mathematics 2025-12-18 Chase Wilson

The first-order theory of finite and infinite trees has been studied since the eighties, especially by the logic programming community. Following Djelloul, Dao and Fr\"uhwirth, we consider an extension of this theory with an additional…

Logic in Computer Science · Computer Science 2020-08-10 Fabian Zaiser , C. -H. Luke Ong

Let $\mathbf G$ be a graphing, that is a Borel graph defined by $d$ measure preserving involutions. We prove that if $\mathbf G$ is {\em treeable} then it arises as the local limit of some sequence $(G_n)_{n\in\mathbb{N}}$ of graphs with…

Combinatorics · Mathematics 2016-01-22 Lucas Hosseini , Patrice Ossona de Mendez

For a finite simplicial graph $\Gamma$, let $A(\Gamma)$ denote the right-angled Artin group on $\Gamma$. Recently Kim and Koberda introduced the extension graph $\Gamma^e$ for $\Gamma$, and established the Extension Graph Theorem: for…

Geometric Topology · Mathematics 2018-07-03 Eon-Kyung Lee , Sang-Jin Lee

Let $G$ be a graph (with multiple edges allowed) and let $T$ be a tree in $G$. We say that $T$ is $\textit{even}$ if every leaf of $T$ belongs to the same part of the bipartition of $T$, and that $T$ is $\textit{weakly even}$ if every leaf…

This work addresses the existence of transitive extensions of certain infinite permutation groups which arise as the automorphism groups of model-theoretic structures which are generic in the Fra\"iss\'e sense. The study of transitive…

Logic · Mathematics 2026-04-15 Felipe Estrada

We state conditions for which a definable local homomorphism between two locally definable groups $\mathcal{G}$, $\mathcal{G^{\prime}}$ can be uniquely extended when $\mathcal{G}$ is simply connected (Theorem 2.1). As an application of this…

Logic · Mathematics 2021-01-26 Eliana Barriga

Alon, Seymour and Thomas [1990] proved that every $n$-vertex graph excluding $K_t$ as a minor has treewidth less than $t^{3/2}\sqrt{n}$. Illingworth, Scott and Wood [2022] recently refined this result by showing that every such graph is a…

For a given metric space $(P,\phi)$, a tree cover of stretch $t$ is a collection of trees on $P$ such that edges $(x,y)$ of trees receive length $\phi(x,y)$, and such that for any pair of points $u,v\in P$ there is a tree $T$ in the…

Computational Geometry · Computer Science 2025-08-26 Artur Bikeev , Andrey Kupavskii , Maxim Turevskii

We show that there is a bijection between the subtoposes of the classifying topos of a geometric theory T over a signature L and the closed geometric theories over L which are `quotients' of the theory T; next, we analyze how classical…

Category Theory · Mathematics 2009-05-05 Olivia Caramello

Let $G$ be a finite group and let $H_1,H_2<G$ be two subgroups. In this paper, we are concerned with the bipartite graph whose vertices are $G/H_1\cup G/H_2$ and a coset $g_1H_1$ is connected with another coset $g_2H_2$ if and only if…

Group Theory · Mathematics 2022-08-25 Péter P. Varjú