Ubiquity in graphs III: Ubiquity of locally finite graphs with extensive tree-decompositions

Nathan Bowler, Christian Elbracht, Joshua Erde, J. Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen

备注：: 57 pages, 6 figures

英文摘要：

A graph $G$ is said to be ubiquitous, if every graph $Γ$ that contains arbitrarily many disjoint $G$-minors automatically contains infinitely many disjoint $G$-minors. The well-known Ubiquity conjecture of Andreae says that every locally finite graph is ubiquitous. In this paper we show that locally finite graphs admitting a certain type of tree-decomposition, which we call an extensive tree-decomposition, are ubiquitous. In particular this includes all locally finite graphs of finite tree-width, and also all locally finite graphs with finitely many ends, all of which have finite degree. It remains an open question whether every locally finite graph admits an extensive tree-decomposition.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

On Andreae's Ubiquity Conjecture

A graph $H$ is ubiquitous if for every graph $G$ that for every natural number $n$ contains $n$ vertex-disjoint $H$-minors contains infinitely many vertex-disjoint $H$-minors. Andreae conjectured that every locally finite graph is ubiquitous. We give a disconnected counterexample to this conjecture. It remains open whether every connected locally finite graph is ubiquitous.

2022-10-10math.CO

Ubiquity in graphs I: Topological ubiquity of trees

Let $\triangleleft$ be a relation between graphs. We say a graph $G$ is \emph{$\triangleleft$-ubiquitous} if whenever $Γ$ is a graph with $nG \triangleleft Γ$ for all $n \in \mathbb{N}$, then one also has $\aleph_0 G \triangleleft Γ$, where $αG$ is the disjoint union of $α$ many copies of $G$. The \emph{Ubiquity Conjecture} of Andreae, a well-known open problem in the theory of infinite graphs, asserts that every locally finite connected graph is ubiquitous with respect to the minor relation. In this paper, which is the first of a series of papers making progress towards the Ubiquity Conjectur…

2018-06-11math.CO

Ubiquity in graphs II: Ubiquity of graphs with nowhere-linear end structure

A graph $G$ is said to be $\preceq$-ubiquitous, where $\preceq$ is the minor relation between graphs, if whenever $Γ$ is a graph with $nG \preceq Γ$ for all $n \in \mathbb{N}$, then one also has $\aleph_0 G \preceq Γ$, where $αG$ is the disjoint union of $α$ many copies of $G$. A well-known conjecture of Andreae is that every locally finite connected graph is $\preceq$-ubiquitous. In this paper we give a sufficient condition on the structure of the ends of a graph~$G$ which implies that $G$ is $\preceq$-ubiquitous. In particular this implies that the full grid is $\preceq$-ubiquitous.

2020-12-28math.CO

The ubiquity of Psi-matroids

Solving (for tame matroids) a problem of Aigner-Horev, Diestel and Postle, we prove that every tame matroid M can be reconstructed from its canonical tree decomposition into 3-connected pieces, circuits and cocircuits together with information about which ends of the decomposition tree are used by M . For every locally finite graph G, we show that every tame matroid whose circuits are topological circles of G and whose cocircuits are bonds of G is determined by the set Psi of ends it uses, that is, it is a Psi-matroid.

2013-04-25math.CO

Locally finite graphs with ends: a topological approach. III. Fundamental group and homology

This paper is the last part of a comprehensive survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends, assume the role played in finite graphs by paths and cycles. The first two parts of the survey together provide a suitable entry point to this field for new readers; they are available in combined form in arXiv:0912.4213. The topological approach indicated above has made it possible to extend to locally finite graphs many classical theorems of finite graph …

2010-05-11math.ATmath.CO

Towards characterizing locally common graphs

A graph H is common if the number of monochromatic copies of H in a 2-edge-coloring of the complete graph is asymptotically minimized by the random coloring. The classification of common graphs is one of the most intriguing problems in extremal graph theory. We study the notion of weakly locally common graphs considered by Csóka, Hubai and Lovász [arXiv:1912.02926], where the graph is required to be the minimizer with respect to perturbations of the random 2-edge-coloring. We give a complete analysis of the 12 initial terms in the Taylor series determining the number of monochromatic copies of…

2022-04-26math.CO

更多相关论文收起更多论文

Rainbow structures in locally bounded colourings of graphs

We prove several results on approximate decompositions of edge-coloured quasirandom graphs into rainbow spanning structures. More precisely, we say that an edge-colouring of a graph is locally $\ell$-bounded if no vertex is incident to more than $\ell$ edges of any given colour, and that it is (globally) $g$-bounded if no colour appears more than $g$ times in the colouring. Note that every proper colouring of an $n$-vertex graph is locally $1$-bounded, and (globally) $n/2$-bounded. Our results imply the following: (i) The existence of approximate decompositions of edge-coloured $K_n$ into rain…

2019-09-28math.CO

Reflection Groups and Polytopes over Finite Fields, III

When the standard representation of a crystallographic Coxeter group is reduced modulo an odd prime p, one obtains a finite group G^p acting on some orthogonal space over Z_p . If the Coxeter group has a string diagram, then G^p will often be the automorphism group of a finite abstract regular polytope. In parts I and II we established the basics of this construction and enumerated the polytopes associated to groups of rank at most 4, as well as all groups of spherical or Euclidean type. Here we extend the range of our earlier criteria for the polytopality of G^p . Building on this we investig…

2007-07-26math.COmath.MG