Packing \(A\)-paths of length zero modulo a prime

DOI10.1016/J.JCTB.2022.12.007OpenAlexW3087827845MaRDI QIDQ2692782

Youngho Yoo, Robin Thomas

Publication date: 23 March 2023

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.12230

zbMATH Keywords

Erdős-Pósa propertygroup-labeled graphs\(A\)-paths

Mathematics Subject Classification ID

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)

Related Items (2)

Packing cycles in undirected group-labelled graphs ⋮ A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups

Cites Work

• Packing non-zero \(A\)-paths in group-labelled graphs
• Packing non-zero \(A\)-paths in an undirected model of group labeled graphs
• Graph minors. X: Obstructions to tree-decomposition
• Über die Maximalzahl kreuzungsfreier H-Wege
• Quickly excluding a planar graph
• Graph minors. XIII: The disjoint paths problem
• Packing \(A\)-paths of length zero modulo four
• A unified Erdős-Pósa theorem for constrained cycles
• A new upper bound for the bipartite Ramsey problem
• Frames, $A$-Paths, and the Erdös--Pósa Property
• $k$-Blocks: A Connectivity Invariant for Graphs
• On Independent Circuits Contained in a Graph
• Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
• A Historical Note
• Packing cycles in undirected group-labelled graphs

This page was built for publication: Packing \(A\)-paths of length zero modulo a prime