Papers
Topics
Authors
Recent
Search
2000 character limit reached

Unifying duality theorems for width parameters in graphs and matroids. II. General duality

Published 15 Jun 2014 in math.CO | (1406.3798v1)

Abstract: We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. Reinhard Diestel 
  2. Sang-il Oum 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up