Pages that link to "Item:Q5964974"
From MaRDI portal
The following pages link to On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\) (Q5964974):
Displaying 14 items.
- A simpler proof and a generalization of the zero-trees theorem (Q1180556) (← links)
- Zero-sum subsequences in bounded-sum \(\{-1,1\}\)-sequences (Q1621429) (← links)
- Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\) (Q2000579) (← links)
- On zero-sum spanning trees and zero-sum connectivity (Q2073300) (← links)
- On small balanceable, strongly-balanceable and omnitonal graphs (Q2158200) (← links)
- Zero-sum copies of spanning forests in zero-sum complete graphs (Q2162505) (← links)
- Zero-sum subsequences in bounded-sum \(\{-r,s\}\)-sequences (Q2221909) (← links)
- Low weight perfect matchings (Q2223441) (← links)
- Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation (Q2685699) (← links)
- Unbalanced spanning subgraphs in edge labeled complete graphs (Q2692172) (← links)
- Spanning trees of different weights (Q3360883) (← links)
- On the existence of zero-sum perfect matchings of complete graphs (Q5881014) (← links)
- Zero-sum squares in \(\{-1, 1\}\)-matrices with low discrepancy (Q6046229) (← links)
- Unavoidable chromatic patterns in 2‐colorings of the complete graph (Q6055932) (← links)
