Thomas's half-integral Erdős–Pósa conjecture for graph minors
Thomas's half-integral Erdős–Pósa conjecture for graph minors
Let be a graph. A graph half-integrally packs graphs if it contains subgraphs isomorphic to those graphs such that every vertex of belongs to at most two of the subgraphs. A graph contains as a minor if can be obtained from a subgraph of by vertex and edge contractions.
Thomas's conjecture. For every graph , there exists a function such that for every graph and every positive integer , either half-integrally packs graphs each containing as a minor, or there exists a set with such that does not contain as a minor.
This conjecture extends the Erdős–Pósa property for graph minors from integral to half-integral packing, potentially removing the planarity restriction on . The source presents it as a conjecture of Thomas; its resolution is not specified here.
Sources & referencesView supporting material
Primary source
Chun-Hung Liu, “Packing Topological Minors Half-Integrally”, arXiv:1707.07221 (2022).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.