Graph minors XXIII. Nash-Williams' immersion conjecture

By N. Robertson, Paul D. Seymour. J. Comb. Theory B, 2010

810 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics

View Paper: https://www.semanticscholar.org/paper/714ed82c3560082e0c724044337d3ad4f506aae6

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Daniel Marx
2. Erik Panzer
3. Chengpeng Zhang
4. Yaokun Wu
5. Eric Katz

In Discrete Mathematics and Combinatorics

1. Daniel Marx
2. Erik Panzer

Citations in the corpus

• Solving Rota's Conjecture (2014, background): “Therefore graphs omitting H1 have a particularly simple structure; see [15].”
• Feynman integrals and hyperlogarithms (2015, background): “21 Hence the theorem of Robertson and Seymour [148] applies: The set of graphs G with vw(G) ≤ 3 can be characterized by a finite set of forbidden minors.”
• Chordality and hyperbolicity of a graph (2009, background): “Especially, lots of ways to define/measure a tree-like structure have been proposed in the literature from many different considerations, just to name a few, say tree-width [85, 86], tree-length [35, 92], combinatorial Supported by Science and Technology Commission of Shanghai Municipality (No.”
• Parameterized Complexity and Approximation Algorithms (2008, background): “However, there are much simpler fpt-algorithms that produce tree decompositions having width at most a constant factor larger than the optimum [105, 102, 103, 4].”