On Andreae's ubiquity conjecture

DOI10.1016/J.JCTB.2023.04.002zbMATH Open1519.05180arXiv2210.02711OpenAlexW4375869220MaRDI QIDQ6170789FDOQ6170789

Authors: Johannes Carmesin 

Publication date: 10 August 2023

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/2210.02711

Recommendations

• Ubiquity of graphs with nowhere‐linear end structure
• scientific article; zbMATH DE number 3920529
• Topological ubiquity of trees
• Classes of locally finite ubiquitous graphs
• On disjoint configurations in infinite graphs

zbMATH Keywords

ubiquityinfinite graphminorswell-quasi orderingAndreae conjecture

Mathematics Subject Classification ID

Infinite graphs (05C63) Graph minors (05C83)

Cites Work

• Über die Maximalzahl fremder unendlicher Wege in Graphen
• On disjoint configurations in infinite graphs
• Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
• Topological ubiquity of trees
• Classes of locally finite ubiquitous graphs

Cited In (5)

• Title not available (Why is that?)
• Ubiquity of oriented rays
• Ubiquity of graphs with nowhere‐linear end structure
• Ubiquity of locally finite graphs with extensive tree-decompositions
• Classes of locally finite ubiquitous graphs

This page was built for publication: On Andreae's ubiquity conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6170789)