Corpus ID: 20496016

Packing Topological Minors Half-Integrally

  title={Packing Topological Minors Half-Integrally},
  author={Chun-Hung Liu},
A family ${\mathcal F}$ of graphs has the Erd\H{o}s-P\'osa property if for every graph $G$, the maximum number of pairwise disjoint subgraphs isomorphic to members of ${\mathcal F}$ contained in $G$ and the minimum size of a set of vertices of $G$ hitting all such subgraphs are bounded by functions of each other. Robertson and Seymour proved that if ${\mathcal F}$ consists of $H$-minors for some fixed graph $H$, then the planarity of $H$ is equivalent with the Erd\H{o}s-P\'osa property. Thomas… Expand
Packing and covering induced subdivisions
Among remaining graphs, it is proved that the subdivisions of the diamond, the 1-pan, and the 2-pan have the induced Erd\H{o}s-P\'osa property. Expand
Half-integral Erd\H{o}s-P\'osa property of directed odd cycles
We prove that there exists a function $f:\mathbb{N}\rightarrow \mathbb{R}$ such that every digraph $G$ contains either $k$ directed odd cycles where every vertex of $G$ is contained in at most two ofExpand
A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three
A graph $G$ contains another graph $H$ as an immersion if $H$ can be obtained from a subgraph of $G$ by splitting off edges and removing isolated vertices. There is an obvious necessary degreeExpand
Erd\H{o}s-P\'osa property for labelled minors: 2-connected minors
In the 1960s, Erd\H{o}s and P\'osa proved that there is a packing-covering duality for cycles in graphs. As part of the graph minor project, Robertson and Seymour greatly extended this: there is suchExpand
M ay 2 01 8 Erdős-Pósa property for labelled minors : 2-connected minors
In the 1960s, Erdős and Pósa proved that there is a packing-covering duality for cycles in graphs. As part of the graph minor project, Robertson and Seymour greatly extended this: there is such aExpand
Packing A-Paths of Length Zero Modulo Four.
We show that A-paths of length 0 modulo 4 have the Erd\H{o}s-P\'osa property. We also prove that A-paths of length 2 modulo 4 have the property but that A-paths of length 1 or of length 3 modulo 4 doExpand
Vertex deletion parameterized by elimination distance and even less
A framework for computing approximately optimal decompositions related to these graph measures is presented, and if the cost of an optimal decomposition is k, it is shown how to find a decomposition of cost kO(1) in time f(k) · nO( 1). Expand


Excluding subdivisions of bounded degree graphs
The structure is not satisfied by graphs that contain a subdivision of a graph $H_3$ that has similar embedding properties as $H$ and has the same maximum degree as £H$. Expand
Structure theorem and isomorphism test for graphs with excluded topological subgraphs
It is proved that for a fixed H, every graph excluding H as a topological subgraph has a tree decomposition where each part is either "almost embeddable" to a fixed surface or has bounded degree with the exception of a bounded number of vertices. Expand
A stronger structure theorem for excluded topological minors
This work strengthensGrohe and Marx's result, giving a more precise description of the latter kind of basic graphs of the decomposition, and only allows graphs that (almost) embed in ways that are impossible for H. Expand
Equivalence of local treewidth and linear local treewidth and its algorithmic applications
The bound generalizes previously known linear bounds for special classes of graphs proved by several authors and obtains substantially faster polynomial-time approximation schemes for a broad class of problems in apex-minor-free graphs. Expand
Diameter and Treewidth in Minor-Closed Graph Families
  • D. Eppstein
  • Mathematics, Computer Science
  • Algorithmica
  • 2000
It is shown that treewidth is bounded by a function of the diameter in a minor-closed family, if and only if some apex graph does not belong to the family, and the O(D) bound above can be extended to bounded-genus graphs. Expand
Piercing d -Intervals
  • N. Alon
  • Computer Science, Mathematics
  • Discret. Comput. Geom.
  • 1998
It is shown that for any finite collection of d-intervals that contains no k + 1 pairwise disjoint members, there is a set of O(dk) points that intersects each member of the collection, and if the quadratic dependence on d is indeed best possible, Kaiser’s estimate is indeed better by roughly a factor of 2. Expand
Half integral packing, Erdős-Posá-property and graph minors
This problem is motivated by the study of the half disjoint paths problem and unspilittable flow problem, e.g. the structure of graphs with no <i>K</i><inf>6</inf>-minor, and it is proved that this problem is solvable in polynomial time. Expand
A family of circuits of a graph G is said to be independent if no two of the circuits have a common vertex ; it is called edge-independent if no two of them have an edge in common . A set of verticesExpand
Graph Minors. XVI. Excluding a non-planar graph
It is found that every graph with no minor isomorphic to L may be constructed by piecing together in a tree-structure graphs each of which "almost" embeds in some surface in which L cannot be embedded. Expand
Approximation algorithms for NP-complete problems on planar graphs
  • B. Baker
  • Mathematics, Computer Science
  • 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
  • 1983
A general technique that can be used to obtain approximation algorithms for various NP-complete problems on planar graphs, which includes maximum independent set, maximum tile salvage, partition into triangles, maximum H-matching, minimum vertex cover, minimum dominating set, and minimum edge dominating set. Expand