Zero-sum copies of spanning forests in zero-sum complete graphs

DOI10.1007/s00373-022-02539-2zbMath1494.05069arXiv2101.11233OpenAlexW3123744079MaRDI QIDQ2162505

Johannes Pardey, Elena Mohr, Dieter Rautenbach

Publication date: 8 August 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

zero-sum Ramsey theoryzero-sum subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (3)

Vertex degrees close to the average degree ⋮ Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation ⋮ Unbalanced spanning subgraphs in edge labeled complete graphs

Cites Work

• Unnamed Item
• Zero-sum problems in finite Abelian groups: a survey
• A simpler proof and a generalization of the zero-trees theorem
• Zero-sum problems -- a survey
• On zero-sum spanning trees and zero-sum connectivity
• Low weight perfect matchings
• On zero-trees
• On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\)

This page was built for publication: Zero-sum copies of spanning forests in zero-sum complete graphs