English
Related papers

Related papers: Graph minors and metric spaces

200 papers

We address the classification problem for graph $C^*$-algebras of finite graphs (finitely many edges and vertices), containing the class of Cuntz-Krieger algebras as a prominent special case. Contrasting earlier work, we do not assume that…

Operator Algebras · Mathematics 2018-03-05 Søren Eilers , Gunnar Restorff , Efren Ruiz , Adam P. W. Sørensen

This paper shows that $K_t$-minor-free (and $K_{s, t}$-minor-free) graphs $G$ are subgraphs of products of a tree-like graph $H$ (of bounded treewidth) and a complete graph $K_m$. Our results include optimal bounds on the treewidth of $H$…

Combinatorics · Mathematics 2024-11-11 Freddie Illingworth , Alex Scott , David R. Wood

Let $P$ be a graph with a vertex $v$ such that $P\backslash v$ is a forest, and let $Q$ be an outerplanar graph. We prove that there exists a number $p=p(P,Q)$ such that every 2-connected graph of path-width at least $p$ has a minor…

Combinatorics · Mathematics 2018-04-17 Thanh N. Dang , Robin Thomas

We geometrically describe the relation induced on a set of graphs by isomorphism of their associated graph C*-algebras as the smallest equivalence relation generated by five types of moves. The graphs studied have finitely many vertices and…

Operator Algebras · Mathematics 2019-10-28 Sara E. Arklint , Søren Eilers , Efren Ruiz

A digraph $H$ is a ``semi-strong minor'' of another, $G$, if a subdivision of $H$ can be obtained from a subdigraph of $G$ by contracting strongly-connected subdigraphs to single vertices. We will define a width measure of ``plane''…

Combinatorics · Mathematics 2026-04-02 Maria Chudnovsky , Paul Seymour

Suppose we are given two graphs on $n$ vertices. We define an observable in the Hilbert space $\Co[(S_n \wr S_2)^m]$ which returns the answer ``yes'' with certainty if the graphs are isomorphic and ``no'' with probability at least…

Quantum Physics · Physics 2007-05-23 Mark Ettinger , Peter Hoyer

We show that Geometric Inhomogeneous Random Graphs (GIRGs) with power law weights may either have or not have separators of linear size, depending on the underlying geometry. While it was known that for Euclidean geometry it is possible to…

Combinatorics · Mathematics 2017-11-13 Johannes Lengler , Lazar Todorovic

It was proved by Huynh, Mohar, \v{S}\'amal, Thomassen and Wood in 2021 that any countable graph containing every countable planar graph as a subgraph has an infinite clique minor. We prove a finite, quantitative version of this result: for…

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…

Combinatorics · Mathematics 2021-01-13 Federico Vigolo

The celebrated Erd\H{o}s-Hajnal conjecture says that any graph without a fixed induced subgraph $H$ contains a very large homogeneous set. A direct analog of this conjecture is not true for hypergraphs. In this paper we present two natural…

Combinatorics · Mathematics 2024-12-02 Fabian Arnold , Lior Gishboliner , Benny Sudakov

We prove that there is a graph isomorphism test running in time $n^{\operatorname{polylog}(h)}$ on $n$-vertex graphs excluding some $h$-vertex graph as a minor. Previously known bounds were $n^{\operatorname{poly}(h)}$ (Ponomarenko, 1988)…

Data Structures and Algorithms · Computer Science 2023-05-30 Martin Grohe , Daniel Neuen , Daniel Wiebking

A parallel minor is obtained from a graph by any sequence of edge contractions and parallel edge deletions. We prove that, for any positive integer k, every internally 4-connected graph of sufficiently high order contains a parallel minor…

Combinatorics · Mathematics 2008-02-12 Carolyn Chun , Guoli Ding , Bogdan Oporowski , Dirk Vertigan

We show that any self-complementary graph with $n$ vertices contains a $K_{\lfloor \frac{n+1}{2}\rfloor}$ minor. We derive topological properties of self-complementary graphs.

Combinatorics · Mathematics 2018-09-27 Andrei Pavelescu , Elena Pavelescu

Given two graphs $G$ and $H$, we define $\textsf{v-cover}_{H}(G)$ (resp. $\textsf{e-cover}_{H}(G)$) as the minimum number of vertices (resp. edges) whose removal from $G$ produces a graph without any minor isomorphic to ${H}$. Also…

Data Structures and Algorithms · Computer Science 2017-01-23 Dimitris Chatzidimitriou , Jean-Florent Raymond , Ignasi Sau , Dimitrios M. Thilikos

Let $(M, g)$ be a compact real analytic Riemannian manifold and $\pi \colon \widetilde{M} \to M$ its universal cover. Assume that $\widetilde{M}$ can be realised as a manifold definable in an o-minimal structure $\Sigma$ expanding…

Differential Geometry · Mathematics 2024-01-17 Vasily Rogov

We show that, for every n and every surface $\Sigma$, there is a graph U embeddable on $\Sigma$ with at most cn^2 vertices that contains as minor every graph embeddable on $\Sigma$ with n vertices. The constant c depends polynomially on the…

Discrete Mathematics · Computer Science 2023-05-12 Cyril Gavoille , Claire Hilaire

We prove a pointwise ergodic theorem for quasi-probability-measure-preserving (quasi-pmp) locally countable measurable graphs, equivalently, Schreier graphs of quasi-pmp actions of countable groups. For ergodic graphs, the theorem gives an…

Dynamical Systems · Mathematics 2023-08-29 Anush Tserunyan

A graph $G$ contains a graph $H$ as an induced minor if $H$ can be obtained from $G$ by vertex deletions and edge contractions. The class of $H$-induced-minor-free graphs generalizes the class of $H$-minor-free graphs, but unlike…

Data Structures and Algorithms · Computer Science 2023-08-10 Tuukka Korhonen , Daniel Lokshtanov

Let $H$ be an infinite-dimensional complex Hilbert space and let ${\mathcal G}_{\infty}(H)$ be the set of all closed subspaces of $H$ whose dimension and codimension both are infinite. We investigate (not necessarily surjective)…

Mathematical Physics · Physics 2024-03-19 Mark Pankov

It is well-known that in finite graphs, large complete minors/topological minors can be forced by assuming a large average degree. Our aim is to extend this fact to infinite graphs. For this, we generalise the notion of the relative end…

Combinatorics · Mathematics 2011-02-03 Maya Stein , José Zamora
‹ Prev 1 4 5 6 7 8 10 Next ›