Imagen de Portada

A Cantor-Bernstein-type theorem for spanning trees in infinite graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Erde, Joshua, Gollin, Pascal, Joó, Atilla, Knappe, Paul, Pitz, Max
Formato:	Preprint
Publicado:	2019
Materias:	Combinatorics 05C63, 05C40
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Counterexamples regarding linked and lean tree-decompositions of infinite graphs
por: Albrechtsen, Sandra, et al.
Publicado: (2024)

On tree-decompositions for infinite chordal graphs
por: Pitz, Max, et al.
Publicado: (2026)

On order-compatible paths in infinite graphs
por: Pitz, Max, et al.
Publicado: (2026)

Linked tree-decompositions into finite parts
por: Albrechtsen, Sandra, et al.
Publicado: (2024)

A metrization theorem for edge-end spaces of infinite graphs
por: Pitz, Max
Publicado: (2025)

The Nash-Williams orientation theorem for graphs with countably many ends
por: Assem, Amena, et al.
Publicado: (2023)

The immersion-minimal infinitely edge-connected graph
por: Knappe, Paul, et al.
Publicado: (2022)

Displaying prescribed sets of ends by linked tree-decompositions
por: Albrechtsen, Sandra, et al.
Publicado: (2025)

Representations of infinite tree-sets
por: Gollin, J. Pascal, et al.
Publicado: (2019)

Obstructions for normally spanned sets of vertices
por: Lorenz, Nicola, et al.
Publicado: (2025)

Circuits through prescribed edges
por: Knappe, Paul, et al.
Publicado: (2018)

Tangle-tree duality in infinite graphs
por: Albrechtsen, Sandra
Publicado: (2024)

A representation theorem for end spaces of infinite graphs
por: Kurkofka, Jan, et al.
Publicado: (2021)

Large flames in rooted acyclic digraphs without backward-infinite paths
por: Joó, Attila, et al.
Publicado: (2025)

Efficiently distinguishing all tangles in locally finite graphs
por: Jacobs, Raphael W., et al.
Publicado: (2023)

A note on uncountably chromatic graphs
por: Bowler, Nathan, et al.
Publicado: (2024)

All graphs are majority 3-choosable
por: Ouborny, Jan, et al.
Publicado: (2025)

A topological characterization of end space of infinite graphs via games, subspaces and products
por: Aurichi, Leandro, et al.
Publicado: (2026)

A star-comb lemma for infinite digraphs
por: Reich, Florian
Publicado: (2024)

Connectoids II: existence of normal trees
por: Bowler, Nathan, et al.
Publicado: (2024)

Canonical graph decompositions via local separations
por: Jacobs, Raphael W., et al.
Publicado: (2025)

Canonical graph decompositions via coverings
por: Diestel, Reinhard, et al.
Publicado: (2022)

Canonical tree-decompositions of chordal graphs
por: Jacobs, Raphael W., et al.
Publicado: (2025)

Refining tree-decompositions so that they display the k-blocks
por: Albrechtsen, Sandra
Publicado: (2024)

Connectoids I: a universal end space theory
por: Bowler, Nathan, et al.
Publicado: (2024)

Edge-ends versus topological ends of graphs
por: Aurichi, Leandro, et al.
Publicado: (2026)

A grid theorem for strong immersions of walls
por: Diestel, Reinhard, et al.
Publicado: (2023)

Locally chordal graphs
por: Abrishami, Tara, et al.
Publicado: (2025)

The Erdős-Pósa property for infinite graphs
por: Krill, Thilo
Publicado: (2024)

On orientations preserving edge-connectivity in infinite graphs
por: Aurichi, Leandro, et al.
Publicado: (2025)

Spectral conditions for spanning $k$-trees or $k$-ended-trees of $t$-connected graphs
por: Lin, Jifu, et al.
Publicado: (2024)

Minimal toughness in subclasses of weakly chordal graphs
por: Gollin, J. Pascal, et al.
Publicado: (2026)

A Menger-type theorem for two induced paths
por: Albrechtsen, Sandra, et al.
Publicado: (2023)

Dominated balanced separators in wheel-induced-minor-free graphs
por: Chudnovsky, Maria, et al.
Publicado: (2025)

On ubiquity problems in infinite digraphs
por: Hamann, Matthias, et al.
Publicado: (2026)

The odd independence number of graphs, II: Finite and infinite grids and chessboard graphs
por: Caro, Yair, et al.
Publicado: (2025)

Tree-independence number and forbidden induced subgraphs: excluding a $6$-vertex path and a $(2,t)$-biclique
por: Chudnovsky, Maria, et al.
Publicado: (2026)

Menger's theorem for ends of digraphs
por: Reich, Florian
Publicado: (2026)

Halin's grid theorem for digraphs
por: Reich, Florian
Publicado: (2024)

On cycle covers of infinite bipartite graphs
por: Aurichi, Leandro, et al.
Publicado: (2025)