A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups
From MaRDI portal
Publication:6199337
DOI10.1112/jlms.12858arXiv2102.01986MaRDI QIDQ6199337
Ken-ichi Kawarabayashi, J. Pascal Gollin, Sang-il Oum, Kevin Hendrey, O.-joung Kwon
Publication date: 23 February 2024
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.01986
Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Packing cycles with modularity constraints
- Packing non-zero \(A\)-paths in an undirected model of group labeled graphs
- Highly parity linked graphs
- Graph minors. V. Excluding a planar graph
- Graph minors. VII: Disjoint paths on a surface
- Mangoes and blueberries
- Graph minors. X: Obstructions to tree-decomposition
- Quickly excluding a planar graph
- Packing directed circuits
- Graph minors. XIII: The disjoint paths problem
- Covering intervals with arithmetic progressions
- Half-integral packing of odd cycles through prescribed vertices
- A unified Erdős-Pósa theorem for constrained cycles
- Excluding a group-labelled graph
- Packing \(A\)-paths of length zero modulo a prime
- Graph Theory
- On the presence of disjoint subgraphs of a specified type
- Representing Homology Classes on Surfaces
- Frames, $A$-Paths, and the Erdös--Pósa Property
- Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs
- On Independent Circuits Contained in a Graph
- Any 𝑛 arithmetic progressions covering the first 2ⁿ integers cover all integers
- The Erdős-Pósa property for odd cycles in highly connected graphs
- The Erdős-Pósa property for odd cycles in graphs of large connectivity
- Packing cycles in undirected group-labelled graphs
- Packing topological minors half‐integrally
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups
