Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation

DOI10.1016/j.dam.2022.12.014OpenAlexW3132997863MaRDI QIDQ2685699

Johannes Pardey, Dieter Rautenbach

Publication date: 22 February 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

zero-sum Ramsey theoryzero-sum subgraphmethod of conditional expectation

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Generalized Ramsey theory (05C55) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Vertex degrees close to the average degree ⋮ Unbalanced spanning subgraphs in edge labeled complete graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Zero-sum problems in finite Abelian groups: a survey
• Zero-sum problems -- a survey
• On zero-sum spanning trees and zero-sum connectivity
• Zero-sum copies of spanning forests in zero-sum complete graphs
• Low weight perfect matchings
• On the existence of zero-sum perfect matchings of complete graphs
• On a combinatorial game
• On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\)

This page was built for publication: Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation