47 citations · 678 across the 85 of their papers we have counts for
4 papers · 1 filter
Number of cliques in graphs with a forbidden subdivision
Choongbum Lee, Sang-il Oum
We prove that for all positive integers , every -vertex graph with no -subdivision has at most cliques. We also prove that asymptotically, such graphs contain…
A relative of Hadwiger's conjecture
Katherine Edwards, Dong Yeap Kang, Jaehoon Kim +2
Hadwiger's conjecture asserts that if a simple graph has no minor, then its vertex set can be partitioned into stable sets. This is still open, but we prov…
Unifying duality theorems for width parameters in graphs and matroids. II. General duality
Reinhard Diestel, Sang-il Oum
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 th…
Abstract Separation Systems
Reinhard Diestel
Abstract separation systems provide a simple general framework in which both tree-shape and high cohesion of many combinatorial structures can be expressed, and their duality prove…