Reinhard Diestel

From MaRDI portal
Person:215083

Available identifiers

zbMath Open diestel.reinhardWikidataQ2140649 ScholiaQ2140649MaRDI QIDQ215083

List of research outcomes

PublicationDate of PublicationType
Tangle-tree duality in abstract separation systems2020-12-30Paper
Profinite separation systems2020-05-26Paper
Tangle-tree duality: in graphs, matroids and beyond2019-11-21Paper
Structural submodularity and tangles in abstract separation systems2019-08-15Paper
Profiles of separations: in graphs, matroids, and beyond2019-05-23Paper
Connected tree-width2018-07-23Paper
Abstract separation systems2018-04-10Paper
Tree sets2018-04-10Paper
Rudolf Halin: 1934--20142018-01-05Paper
Ends and tangles2018-01-05Paper
Duality Theorems for Blocks and Tangles in Graphs2017-07-14Paper
https://portal.mardi4nfdi.de/entity/Q52726252017-06-30Paper
Dual trees must share their ends2017-01-26Paper
Graph Theory2016-10-27Paper
A simple existence criterion for normal spanning trees2016-05-20Paper
Canonical tree-decompositions of finite graphs. II. Essential parts2016-03-14Paper
Canonical tree-decompositions of finite graphs. I: Existence and algorithms.2015-12-11Paper
The structure of 2-separations of infinite matroids2015-12-11Paper
Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract)2015-09-09Paper
$k$-Blocks: A Connectivity Invariant for Graphs2015-04-17Paper
Forcing finite minors in sparse infinite graphs by large-degree assumptions2015-03-11Paper
Orthogonality and minimality in the homology of locally finite graphs2014-09-30Paper
Connectivity and tree structure in finite graphs2014-08-14Paper
Axioms for infinite matroids2014-01-08Paper
https://portal.mardi4nfdi.de/entity/Q28573122013-11-01Paper
Every rayless graph has an unfriendly partition2013-10-10Paper
On the excluded minor structure theorem for graphs of large tree-width2013-01-14Paper
The Erdős-Pósa property for clique minors in highly connected graphs2012-05-04Paper
Locally finite graphs with ends: a topological approach. III. Fundamental group and homology2012-01-11Paper
Every rayless graph has an unfriendly partition2011-12-19Paper
The homology of a locally finite graph with ends2011-12-19Paper
Locally finite graphs with ends: A topological approach. I: Basic theory2011-08-08Paper
Infinite matroids in graphs2011-08-08Paper
On the homology of locally compact spaces with ends2011-08-04Paper
The fundamental group of a locally finite graph with ends2011-02-09Paper
Twins of rayless graphs2011-01-14Paper
Locally finite graphs with ends: A topological approach. II: Applications2010-10-18Paper
https://portal.mardi4nfdi.de/entity/Q35867242010-09-01Paper
https://portal.mardi4nfdi.de/entity/Q35778332010-07-26Paper
On Infinite Cycles in Graphs: Or How to Make Graph Homology Interesting2010-06-01Paper
MacLane's theorem for arbitrary surfaces2009-03-04Paper
A Cantor-Bernstein Theorem for Paths in Graphs2008-02-05Paper
Partitions and orientations of the Rado graph2007-02-01Paper
End spaces and spanning trees2007-01-16Paper
Global connectivity and expansion: long cycles and factors in \(f\)-connected graphs2006-06-30Paper
https://portal.mardi4nfdi.de/entity/Q54720762006-06-14Paper
Duality in Infinite Graphs2006-03-13Paper
https://portal.mardi4nfdi.de/entity/Q33748652006-02-23Paper
Menger's theorem for infinite graphs with ends2005-12-08Paper
Cycle‐cocycle partitions and faithful cycle covers for locally finite graphs2005-11-07Paper
https://portal.mardi4nfdi.de/entity/Q53150232005-09-06Paper
On infinite cycles. I, II2005-07-05Paper
Dense minors in graphs of large girth2005-07-05Paper
The Cycle Space of an Infinite Graph2005-04-04Paper
A short proof of Halin's grid theorem2005-02-28Paper
Graph minor hierarchies2005-02-22Paper
The Erdős-Menger conjecture for source/sink sets with disjoint closures2005-02-09Paper
Topological paths, cycles and spanning trees in infinite graphs2004-10-04Paper
https://portal.mardi4nfdi.de/entity/Q47929092003-09-04Paper
On the cofinality of infinite partially ordered sets: Factoring a poset into lean essential subsets2003-08-21Paper
The countable Erdős-Menger conjecture with ends2003-08-20Paper
Graph-theoretical versus topological ends of graphs.2003-08-20Paper
Normal Spanning Trees, Aronszajn Trees and Excluded Minors2002-10-22Paper
Relating subsets of a poset, and a partition theorem for WQOs2002-08-21Paper
A conjecture concerning a limit of non-Cayley graphs2002-05-13Paper
https://portal.mardi4nfdi.de/entity/Q45214952001-08-30Paper
Highly connected sets and the excluded grid theorem2000-11-29Paper
https://portal.mardi4nfdi.de/entity/Q45072282000-10-17Paper
Excluding a countable clique2000-05-04Paper
https://portal.mardi4nfdi.de/entity/Q49473932000-04-17Paper
https://portal.mardi4nfdi.de/entity/Q47005322000-02-27Paper
https://portal.mardi4nfdi.de/entity/Q43478731997-08-11Paper
https://portal.mardi4nfdi.de/entity/Q43478901997-08-11Paper
https://portal.mardi4nfdi.de/entity/Q43426321997-06-24Paper
The Classification of Finitely Spreading Graphs1997-06-11Paper
https://portal.mardi4nfdi.de/entity/Q47154421996-11-14Paper
Graph Minors I: A Short Proof of the Path-width Theorem1996-01-07Paper
Normal Tree Orders for Infinite Graphs1994-12-19Paper
The Growth of Infinite Graphs: Boundedness and Finite Spreading1994-10-24Paper
Domination games on infinite graphs1994-09-25Paper
The depth-first search tree structure of \(TK_{\aleph_ 0}\)-free graphs1994-09-13Paper
Menger's Theorem for a Countable Source Set1994-09-13Paper
Dominating Functions and Graphs1994-08-30Paper
https://portal.mardi4nfdi.de/entity/Q42738631994-01-13Paper
On vertex transitive graphs of infinite degree1993-11-15Paper
A proof of the bounded graph conjecture1993-04-01Paper
On spanning trees and \(k\)-connectedness in infinite graphs1993-03-10Paper
The end structure of a graph: Recent results and open problems1993-01-16Paper
Decomposing infinite graphs1992-09-27Paper
The structure of \(TK_ a\)-free graphs1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39945741992-09-17Paper
https://portal.mardi4nfdi.de/entity/Q39991501992-09-17Paper
A compactness theorem for complete separators1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39725161992-06-25Paper
Simplicial tree-decompositions of infinite graphs. III: The uniqueness of prime decompositions1990-01-01Paper
Simplicial tree-decompositions of infinite graphs. I1990-01-01Paper
Simplicial tree-decompositions of infinite graphs. II: The existence of prime decompositions1990-01-01Paper
On end-faithful spanning trees in infinite graphs1990-01-01Paper
Simplicial decompositions of graphs: A survey of applications1989-01-01Paper
Tree-decompositions, tree-representability and chordal graphs1988-01-01Paper
Simplicial minors and decompositions of graphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38098341988-01-01Paper
Simplicial decompositions of graphs - some uniqueness results1987-01-01Paper
A separation property of planar triangulations1987-01-01Paper
Some remarks on universal graphs1985-01-01Paper
On the problem of finding small subdivision and homomorphism bases for classes of countable graphs1985-01-01Paper
On universal graphs with forbidden topological subgraphs1985-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Reinhard Diestel