On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\)

DOI10.1007/s00373-015-1541-6zbMath1331.05098OpenAlexW2781799547MaRDI QIDQ5964974

Raphael Yuster, Yair Caro

Publication date: 2 March 2016

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

Full work available at URL: https://doi.org/10.1007/s00373-015-1541-6

zbMATH Keywords

subgraphzero-sum

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Signed and weighted graphs (05C22)

Related Items (12)

On the existence of zero-sum perfect matchings of complete graphs ⋮ Zero-sum subsequences in bounded-sum \(\{-1,1\}\)-sequences ⋮ On small balanceable, strongly-balanceable and omnitonal graphs ⋮ Zero-sum copies of spanning forests in zero-sum complete graphs ⋮ Zero-sum squares in \(\{-1, 1\}\)-matrices with low discrepancy ⋮ Unavoidable chromatic patterns in 2‐colorings of the complete graph ⋮ Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation ⋮ Unbalanced spanning subgraphs in edge labeled complete graphs ⋮ Zero-sum subsequences in bounded-sum \(\{-r,s\}\)-sequences ⋮ Low weight perfect matchings ⋮ Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\) ⋮ On zero-sum spanning trees and zero-sum connectivity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simpler proof and a generalization of the zero-trees theorem
• A complete characterization of the zero-sum (mod 2) Ramsey numbers
• Zero-sum square matrices
• Zero-sum problems -- a survey
• A remark on the existence of finite graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• On zero-trees
• On zero sum Ramsey numbers: Multiple copies of a graph
• On a problem of K. Zarankiewicz

This page was built for publication: On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\)